Generalization of the Double-Reversal Method of Finding a Canonical Residual Finite State Automaton
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.
- 3.Brzozowski, J.: Canonical regular expressions and minimal state graphs for definite events. In: Proceedings of the Symposium on Mathematical Theory of Automata. MRI Symposia Series, vol. 12, pp. 529–561. Polytechnic Press, Polytechnic Institute of Brooklyn, New York (1963)Google Scholar
- 6.Myers, R.S.R., Adámek, J., Milius, S., Urbat, H.: Canonical nondeterministic automata. In: Bonsangue, M.M. (ed.) CMCS 2014. LNCS, vol. 8446, pp. 189–210. Springer, Heidelberg (2014) Google Scholar