Note on Reversal of Binary Regular Languages

@inproceedings{Jirskov2011NoteOR,
  title={Note on Reversal of Binary Regular Languages},
  author={Galina Jir{\'a}skov{\'a} and Juraj Sebej},
  booktitle={DCFS},
  year={2011}
}
  • Galina Jirásková, Juraj Sebej
  • Published in DCFS 2011
  • Mathematics, Computer Science
  • We present binary deterministic finite automata of n states that meet the upper bound 2n on the state complexity of reversal. The automata have a single final state and are one-cycle-free-path, thus the witness languages are deterministic union-free. This result allows us to describe a binary language such that the nondeterministic state complexity of the language and of its complement is n and n + 1, respectively, while the state complexity of the language is 2n. We also show that there is no… CONTINUE READING

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    Citations

    Publications citing this paper.
    SHOWING 1-3 OF 3 CITATIONS

    A Survey on Operational State Complexity

    VIEW 4 EXCERPTS
    CITES BACKGROUND
    HIGHLY INFLUENCED