Skip to main content
SpringerLink
Log in

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

  • Conference paper
  • First Online:
Descriptional Complexity of Formal Systems (DCFS 2015)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9118))

Included in the following conference series:

Abstract

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.

This work was supported by the ERDF funded CoE project EXCS and the Estonian Ministry of Education and Research institutional research grant IUT33-13.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  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)

    Chapter  Google Scholar 

  2. Brzozowski, J., Tamm, H.: Theory of átomata. Theor. Comput. Sci. 539, 13–27 (2014)

    Article  MATH  MathSciNet  Google Scholar 

  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. Denis, F., Lemay, A., Terlutte, A.: Residual finite state automata. Fund. Inform. 51, 339–368 (2002)

    MATH  MathSciNet  Google Scholar 

  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)

    Chapter  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 

Download references

Author information

Authors and Affiliations

  1. Institute of Cybernetics, Tallinn University of Technology, Akadeemia tee 21, 12618, Tallinn, Estonia

    Hellis Tamm

Authors
  1. Hellis Tamm
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hellis Tamm .

Editor information

Editors and Affiliations

  1. School of Computer Science, University of Waterloo, Waterloo, Ontario, Canada

    Jeffrey Shallit

  2. Department of Mathematics, University of Turku, Turku, Finland

    Alexander Okhotin

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

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. https://doi.org/10.1007/978-3-319-19225-3_23

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-19225-3_23

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-19224-6

  • Online ISBN: 978-3-319-19225-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation