Skip to main content
SpringerLink
Log in

On Transition Minimality of Bideterministic Automata

  • Conference paper
Developments in Language Theory (DLT 2007)

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

Included in the following conference series:

Abstract

Bideterministic automata are deterministic automata with the property of their reversal automata also being deterministic. Bideterministic automata have previously been shown to be unique (up to an isomorphism) minimal NFAs with respect to the number of states. In this paper, we show that in addition to state minimality, bideterministic automata are also transition-minimal NFAs. However, as this transition minimality is not necessarily unique, we also present the necessary and sufficient conditions for a bideterministic automaton to be uniquely transition-minimal among NFAs. Furthermore, we show that bideterministic automata are transition-minimal ε-NFAs.

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

References

  1. Yu, S.: State complexity: recent results and open problems. Fundamenta Informaticae 64, 471–480 (2005)

    MATH  MathSciNet  Google Scholar 

  2. Hromkovic, J.: Descriptional complexity of finite automata: concepts and open problems. Journal of Automata, Languages and Combinatorics 7, 519–531 (2002)

    MATH  MathSciNet  Google Scholar 

  3. Moore, F.: On the bounds for state-set size in the proofs of equivalence between deterministic, nondeterministic, and two-way finite automata. IEEE Trans. Comput. C-20, 1211–1214 (1971)

    Article  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  5. Tamm, H., Ukkonen, E.: Bideterministic automata and minimal representations of regular languages. Theoretical Computer Science 328, 135–149 (2004)

    Article  MATH  MathSciNet  Google Scholar 

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

    MathSciNet  Google Scholar 

  7. Pin, J.E.: On reversible automata. In: Simon, I. (ed.) LATIN 1992. LNCS, vol. 583, pp. 401–416. Springer, Heidelberg (1992)

    Chapter  Google Scholar 

  8. Latteux, M., Roos, Y., Terlutte, A.: BiRFSA languages and minimal NFAs. Technical Report GRAPPA-0205, GRAPPA (2005)

    Google Scholar 

  9. Domaratzki, M., Salomaa, K.: Lower bounds for the transition complexity of NFAs. In: Královič, R., Urzyczyn, P. (eds.) MFCS 2006. LNCS, vol. 4162, pp. 315–326. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  10. Gruber, H., Holzer, M.: Results on the average state and transition complexity of finite automata accepting finite languages. In: Proceedings of DCFS, Computer Science Technical Report, NMSU-CS-2006-001, New Mexico State University, pp. 267–275 (2006)

    Google Scholar 

  11. Hromkovic, J., Schnitger, G.: NFAs with and without ε-transitions. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 385–396. Springer, Heidelberg (2005)

    Google Scholar 

  12. Arnold, A., Dicky, A., Nivat, M.: A note about minimal non-deterministic automata. Bull. EATCS 47, 166–169 (1992)

    MATH  Google Scholar 

  13. Sakarovitch, J.: Elements of Automata Theory (to appear)

    Google Scholar 

  14. John, S.: Minimal unambiguous ε-NFA. Technical Report TR-2003-22, Technical University Berlin (2003)

    Google Scholar 

  15. John, S.: Minimal unambiguous ε-NFA. In: Domaratzki, M., Okhotin, A., Salomaa, K., Yu, S. (eds.) CIAA 2004. LNCS, vol. 3317, pp. 190–201. Springer, Heidelberg (2005)

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  17. McNaughton, R.: The loop complexity of pure-group events. Information and Control 11, 167–176 (1967)

    Article  MATH  MathSciNet  Google Scholar 

  18. Cohen, R.S.: Star height of certain families of regular events. J. Comput. Syst. Sci. 4, 281–297 (1970)

    MATH  Google Scholar 

  19. Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (1979)

    MATH  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  21. Tamm, H.: On minimality and size reduction of one-tape and multitape finite automata. PhD thesis, Department of Computer Science, University of Helsinki, Finland (2004)

    Google Scholar 

  22. Polak, L.: Minimalizations of NFA using the universal automaton. International Journal of Foundations of Computer Science 16, 999–1010 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  23. Lombardy, S.: On the construction of reversible automata for reversible languages. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol. 2380, pp. 170–182. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Cybernetics, 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

Editor information

Tero Harju Juhani Karhumäki Arto Lepistö

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tamm, H. (2007). On Transition Minimality of Bideterministic Automata. In: Harju, T., Karhumäki, J., Lepistö, A. (eds) Developments in Language Theory. DLT 2007. Lecture Notes in Computer Science, vol 4588. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73208-2_38

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-73208-2_38

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-73207-5

  • Online ISBN: 978-3-540-73208-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation