Generalization of the Double-Reversal Method of Finding a Canonical Residual Finite State Automaton

  • Hellis TammEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9118)


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.


Residual Finite State Automata Terlutter Nondeterministic Finite Automata (NFA) Regular Languages Left Quotient 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Brzozowski, J., Tamm, H.: Theory of átomata. In: Mauri, G., Leporati, A. (eds.) DLT 2011. LNCS, vol. 6795, pp. 105–116. Springer, Heidelberg (2011) CrossRefGoogle Scholar
  2. 2.
    Brzozowski, J., Tamm, H.: Theory of átomata. Theor. Comput. Sci. 539, 13–27 (2014)zbMATHMathSciNetCrossRefGoogle Scholar
  3. 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
  4. 4.
    Denis, F., Lemay, A., Terlutte, A.: Residual finite state automata. Fund. Inform. 51, 339–368 (2002)zbMATHMathSciNetGoogle Scholar
  5. 5.
    Denis, F., Lemay, A., Terlutte, A.: Residual finite state automata. In: Ferreira, A., Reichel, H. (eds.) STACS 2001. LNCS, vol. 2010, pp. 144–157. Springer, Heidelberg (2001) CrossRefGoogle Scholar
  6. 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

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  1. 1.Institute of CyberneticsTallinn University of TechnologyTallinnEstonia

Personalised recommendations