Implementation and Application of Automata

@inproceedings{Moreira2012ImplementationAA,
  title={Implementation and Application of Automata},
  author={Nelma Moreira and Rog{\'e}rio Reis},
  booktitle={Lecture Notes in Computer Science},
  year={2012}
}
Regular languages that are most complex under common complexity measures are studied. In particular, certain ternary languages Un(a, b, c), n 3, over the alphabet {a, b, c} are examined. It is proved that the state complexity bounds that hold for arbitrary regular languages are also met by the languages Un(a, b, c) for union, intersection, difference, symmetric difference, product (concatenation) and star. Maximal bounds are also met by Un(a, b, c) for the number of atoms, the quotient… CONTINUE READING

Similar Papers

Figures, Tables, and Topics from this paper.

References

Publications referenced by this paper.
SHOWING 1-10 OF 46 REFERENCES