Skip to main content
SpringerLink
Log in

Nondeterministic Biautomata and Their Descriptional Complexity

  • Conference paper
Descriptional Complexity of Formal Systems (DCFS 2013)

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

Included in the following conference series:

Abstract

We investigate the descriptional complexity of nondeterministic biautomata, which are a generalization of biautomata [O. Klíma, L. Polák: On biautomata. RAIRO—Theor. Inf. Appl., 46(4), 2012]. Simply speaking, biautomata are finite automata reading the input from both sides; although the head movement is nondeterministic, additional requirements enforce biautomata to work deterministically. First we study the size blow-up when determinizing nondeterministic biautomata. Further, we give tight bounds on the number of states for nondeterministic biautomata accepting regular languages relative to the size of ordinary finite automata, regular expressions, and syntactic monoids. It turns out that as in the case of ordinary finite automata nondeterministic biautomata are superior to biautomata with respect to their relative succinctness in representing regular languages.

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. Berry, G., Sethi, R.: From regular expressions to deterministic automata. Theoret. Comput. Sci. 48(3), 117–126 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  2. Birget, J.C.: Intersection and union of regular languages and state complexity. Inform. Process. Lett. 43, 185–190 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  3. Champarnaud, J.M., Dubernard, J.P., Jeanne, H., Mignot, L.: Two-sided derivatives for regular expressions and for hairpin expressions. arXiv:1301.3316v1 [cs.FL] (2012)

    Google Scholar 

  4. Glaister, I., Shallit, J.: A lower bound technique for the size of nondeterministic finite automata. Inform. Process. Lett. 59, 75–77 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  5. Glushkov, V.M.: The abstract theory of automata. Russian Mathematics Surveys 16, 1–53 (1961)

    Article  Google Scholar 

  6. Hartmanis, J.: On the succinctness of different representations of languages. SIAM J. Comput. 9(1), 114–120 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  7. Holzer, M., Jakobi, S.: Minimization, characterizations, and nondeterminism for biautomata. IFIG Research Report 1301, Institut für Informatik, Justus-Liebig-Universität Gießen, Arndtstr. 2, D-35392 Gießen, Germany (2013)

    Google Scholar 

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

    Google Scholar 

  9. Jirásková, G., Klíma, O.: Descriptional complexity of biautomata. In: Kutrib, M., Moreira, N., Reis, R. (eds.) DCFS 2012. LNCS, vol. 7386, pp. 196–208. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  10. Klíma, O., Polák, L.: On biautomata. RAIRO–Informatique Théorique et Applications/Theoretical Informatics and Applications 46(4), 573–592 (2012)

    Article  MATH  Google Scholar 

  11. Loukanova, R.: Linear context free languages. In: Jones, C.B., Liu, Z., Woodcock, J. (eds.) ICTAC 2007. LNCS, vol. 4711, pp. 351–365. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  12. McNaughton, R., Yamada, H.: Regular expressions and state graphs for automata. IRE Transactions on Electronic Computers EC-9(1), 39–47 (1960)

    Article  Google Scholar 

  13. Meyer, A.R., Fischer, M.J.: Economy of description by automata, grammars, and formal systems. In: Proceedings of the 12th Annual Symposium on Switching and Automata Theory, pp. 188–191. IEEE Computer Society Press (1971)

    Google Scholar 

  14. Rosenberg, A.L.: A machine realization of the linear context-free languages. Inform. Control 10, 175–188 (1967)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Universität Giessen, Arndtstr. 2, 35392, Giessen, Germany

    Markus Holzer & Sebastian Jakobi

Authors
  1. Markus Holzer
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sebastian Jakobi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Middlesex College, Western University, N6A 5B7, London, ON, Canada

    Helmut Jurgensen

  2. Departamento de Ciência de Computadores, Universidade do Porto, Faculdade de Ciências, Rua do Campo Alegre 1021-1055,, 4169-007, Porto, Portugal

    Rogério Reis

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Holzer, M., Jakobi, S. (2013). Nondeterministic Biautomata and Their Descriptional Complexity. In: Jurgensen, H., Reis, R. (eds) Descriptional Complexity of Formal Systems. DCFS 2013. Lecture Notes in Computer Science, vol 8031. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39310-5_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-39310-5_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-39309-9

  • Online ISBN: 978-3-642-39310-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation