Bideterministic Automata and Minimal Representations of Regular Languages
Bideterministic automata are deterministic automata with the property of their reversal automata also being deterministic. It has been known that a bideterministic automaton is the minimal deterministic automaton accepting its language. This paper shows that any bideterministic automaton is the unique minimal automaton among all (including nondeterministic) automata accepting the same language. We also present a more general result that shows that under certain conditions a minimal deterministic automaton accepting some language or the reversal of the minimal deterministic automaton of the reversal language is a minimal automaton representation of the language. These conditions can be checked in polynomial time.
KeywordsRegular Language Minimum Cover Candidate State Minimal Representation Deterministic Automaton
Unable to display preview. Download preview PDF.
- Hopcroft, J. E., and Ullman, J.D. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley 1979.Google Scholar
- Pin, J.-E. On reversible automata. In Proceedings of the first LATIN conference, Lecture Notes in Computer Science 583, Springer, 1992, 401–416.Google Scholar