Skip to main content
SpringerLink
Log in
Book cover

International Conference on Implementation and Application of Automata

CIAA 2004: Implementation and Application of Automata pp 2–22Cite as

Enumerating Regular Expressions and Their Languages

  • Conference paper

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

Abstract

We discuss enumeration of regular expressions and the distinct languages they represent.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Chomsky, N., Schützenberger, M.P.: The algebraic theory of context-free languages. In: Braffort, P., Hirschberg, D. (eds.) Computer Programming and Formal Systems, pp. 118–161. North Holland, Amsterdam (1963)

    Chapter  Google Scholar 

  2. Domaratzki, M., Kisman, D., Shallit, J.: On the number of distinct languages accepted by finite automata with n states. J. Automata, Languages, and Combinatorics 7, 469–486 (2002)

    MATH  MathSciNet  Google Scholar 

  3. Ellul, K., Krawetz, B., Shallit, J., Wang, M.-w.: Regular expressions: new results and open problems. To appear in J. Autom. Lang. Combin. (2003)

    Google Scholar 

  4. Goulden, I.P., Jackson, D.M.: Combinatorial Enumeration. Wiley, Chichester (1983)

    MATH  Google Scholar 

  5. Klarner, D.A., Woodworth, P.: Asymptotics for coefficients of algebraic functions. Aequationes Math. 23, 236–241 (1981)

    Article  MATH  MathSciNet  Google Scholar 

  6. Martin, J.C.: Introduction to Languages and the Theory of Computation, 3rd edn. McGraw-Hill, New York (2003)

    Google Scholar 

  7. Raymond, D., Wood, D.: Grail: a C++ library for automata and expressions. J. Symbolic Comput. 17, 341–350 (1994)

    Article  MATH  Google Scholar 

  8. Rudin, W.: Real and Complex Analysis. McGraw-Hill, New York (1966)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science, University of Waterloo, Waterloo, ON N2L 3G1, Canada

    Jonathan Lee & Jeffrey Shallit

Authors
  1. Jonathan Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jeffrey Shallit
    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 Manitoba, R3T 2N2, Winnipeg, MB, Canada

    Michael Domaratzki

  2. Department of Mathematics, University of Turku, Finland

    Alexander Okhotin

  3. School of Computing, Queen’s University, K7L 3N6, Kingston, Ontario, Canada

    Kai Salomaa

  4. Department of Computer Science, University of Western Ontario, N6A 5B7, London, Ontario, Canada

    Sheng Yu

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lee, J., Shallit, J. (2005). Enumerating Regular Expressions and Their Languages. In: Domaratzki, M., Okhotin, A., Salomaa, K., Yu, S. (eds) Implementation and Application of Automata. CIAA 2004. Lecture Notes in Computer Science, vol 3317. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30500-2_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30500-2_2

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation