Skip to main content
SpringerLink
Log in

More Concise Representation of Regular Languages by Automata and Regular Expressions

  • Conference paper
Developments in Language Theory (DLT 2008)

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

Included in the following conference series:

Abstract

We consider two formalisms for representing regular languages: constant height pushdown automata and straight line programs for regular expressions. We constructively prove that their sizes are polynomially related. Comparing them with the sizes of finite state automata and regular expressions, we obtain optimal exponential and double exponential gaps, i.e., a more concise representation of regular languages.

This work was partially supported by the Slovak Grant Agency for Science (VEGA) under contract “Combinatorial Structures and Complexity of Algorithms” .

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. Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading (1974)

    MATH  Google Scholar 

  2. Brüggemann-Klein, A.: Regular expressions into finite automata. Theoretical Computer Science 120, 197–213 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  3. Caron, P., Ziadi, D.: Characterization of Glushkov automata. Theoretical Computer Science 233, 75–90 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  4. Chandra, A., Kozen, D., Stockmeyer, L.: Alternation. J. ACM 28, 114–133 (1981)

    Article  MATH  MathSciNet  Google Scholar 

  5. Ehrenfeucht, A., Zieger, P.: Complexity measures for regular expressions. J. Computer and System Sciences 12, 134–146 (1976)

    MATH  Google Scholar 

  6. Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (2001)

    MATH  Google Scholar 

  7. Kleene, S.: Representation of events in nerve nets and finite automata. In: Shannon, C., McCarthy, J. (eds.) Automata Studies, pp. 3–42. Princeton University Press, Princeton (1956)

    Google Scholar 

  8. Meyer, A.R., Fischer, M.J.: Economy of description by automata, grammars, and formal systems. In: IEEE 12th Symp. Switching and Automata Theory, pp. 188–191 (1971)

    Google Scholar 

  9. Rabin, M.: Probabilistic automata. Information and Control 6, 230–245 (1963)

    Article  Google Scholar 

  10. Rabin, M., Scott, D.: Finite automata and their decision problems. IBM J. Res. Develop. 3, 114–125 (1959)

    Article  MathSciNet  Google Scholar 

  11. Shepherdson, J.C.: The reduction of two–way automata to one–way automata. IBM J. Res. Develop. 3, 198–200 (1959)

    MathSciNet  Google Scholar 

  12. Valiant, L.G.: Regularity and related problems for deterministic pushdown automata. J. ACM 22, 1–10 (1975)

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, P. J. Šafárik University, Jesenná 5, 04154, Košice, Slovakia

    Viliam Geffert

  2. Dipartimento di Scienze dell’Informazione, Università degli Studi di Milano, via Comelico 39, 20135, Milano, Italy

    Carlo Mereghetti & Beatrice Palano

Authors
  1. Viliam Geffert
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Carlo Mereghetti
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Beatrice Palano
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Masami Ito Masafumi Toyama

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Geffert, V., Mereghetti, C., Palano, B. (2008). More Concise Representation of Regular Languages by Automata and Regular Expressions. In: Ito, M., Toyama, M. (eds) Developments in Language Theory. DLT 2008. Lecture Notes in Computer Science, vol 5257. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85780-8_28

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-85780-8_28

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-85779-2

  • Online ISBN: 978-3-540-85780-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation