iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://doi.org/10.1007/3-540-45089-0_7
Bideterministic Automata and Minimal Representations of Regular Languages | SpringerLink
Skip to main content
Springer Nature Link
Log in

Bideterministic Automata and Minimal Representations of Regular Languages

  • Conference paper
  • First Online:
Implementation and Application of Automata (CIAA 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2759))

Included in the following conference series:

Abstract

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.

Work supported by the Academy of Finland grant 201560.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Angluin, D. Inference of reversible languages. Journal of the Association for Computing Machinery 29,3 (1982), 741–765.

    MATH  MathSciNet  Google Scholar 

  2. Brzozowski, J. A. 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, Polytechnic Press, Polytechnic Institute of Brooklyn, N.Y., 1963, 529–561.

    MathSciNet  Google Scholar 

  3. Hopcroft, J. E., and Ullman, J.D. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley 1979.

    Google Scholar 

  4. Jiang, T., and Ravikumar, B. Minimal NFA problems are hard. SIAM J. Comput. 22,6 (1993), 1117–1141.

    Article  MATH  MathSciNet  Google Scholar 

  5. Kameda, T., and Weiner, P. On the state minimization of nondeterministic automata. IEEE Trans. Comput. C-19,7 (1970), 617–627.

    Article  MathSciNet  Google Scholar 

  6. Muder, D. J. Minimal trellises for block codes. IEEE Trans. Inform. Theory 34,5 (1988), 1049–1053.

    Article  MathSciNet  Google Scholar 

  7. 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 

  8. Shankar, P., Dasgupta, A., Deshmukh K., and Rajan B. S. On viewing block codes as finite automata. Theoretical Computer Science, 290,3 (2003), 1775–1797.

    Article  MATH  MathSciNet  Google Scholar 

  9. Watson, B. W. Taxonomies and toolkits of regular language algorithms. PhD dissertation, Faculty of Mathematics and Computing Science, Eindhoven University of Technology, Eindhoven, The Netherlands, 1995.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Helsinki, P.O. Box 26, 00014, Finland

    Hellis Tamm & Esko Ukkonen

Authors
  1. Hellis Tamm
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Esko Ukkonen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of California, Santa Barbara, CA, 93106, USA

    Oscar H. Ibarra

  2. School of Electrical Engineering and Computer Science, Washington State University, Pullman, WA, 99163, USA

    Zhe Dang

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tamm, H., Ukkonen, E. (2003). Bideterministic Automata and Minimal Representations of Regular Languages. In: Ibarra, O.H., Dang, Z. (eds) Implementation and Application of Automata. CIAA 2003. Lecture Notes in Computer Science, vol 2759. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45089-0_7

Download citation

  • DOI: https://doi.org/10.1007/3-540-45089-0_7

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40561-0

  • Online ISBN: 978-3-540-45089-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation