Generalization of the Double-Reversal Method of Finding a Canonical Residual Finite State Automaton
- Cite this paper as:
- Tamm H. (2015) Generalization of the Double-Reversal Method of Finding a Canonical Residual Finite State Automaton. In: Shallit J., Okhotin A. (eds) Descriptional Complexity of Formal Systems. DCFS 2015. Lecture Notes in Computer Science, vol 9118. Springer, Cham
Residual finite state automata (RFSA) are a subclass of nondeterministic finite automata with the property that every state of an RFSA defines a residual language (a left quotient) of the language accepted by the RFSA. Every regular language has a unique canonical RFSA which is a minimal RFSA accepting the language. We study the relationship of RFSAs with atoms of regular languages. We generalize the double-reversal method of finding a canonical RFSA, presented by Denis, Lemay, and Terlutte.