Skip to main content
SpringerLink
Log in

The Effect of Rewriting Regular Expressions on Their Accepting Automata

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

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

References

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

    Google Scholar 

  2. Thompson, K.: Regular Expression Search Algorithm. Communications of the ACM 11(6) (1968) 419–422

    Article  MATH  Google Scholar 

  3. Glushkov, V.M.: The Abstract Theory of Automata. Russian Math. Surveys 16 (1961) 1–53

    Article  Google Scholar 

  4. Ilie, L., Yu, S.: Constructing NFAs by Optimal Use of Positions in Regular Expressions. In: Lecture Notes in Computer Science: Proceedings of the 13th CPM, Springer-Verlag (2002) 279–288

    Google Scholar 

  5. Frishert, M., Watson, B.W.: The Effect of Rewriting Regular Expressions on Their Accepting Automata. Technical report, Technische Universiteit Eindhoven (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Computer Science, Technische Universiteit Eindhoven, P.O.Box 513, NL-5600 MB, Eindhoven, The Netherlands

    Michiel Frishert & Loek G. Cleophas

  2. Department of Computer Science, University of Pretoria, Pretoria, 0002, South Africa

    Bruce W. Watson

Authors
  1. Michiel Frishert
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Loek G. Cleophas
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Bruce W. Watson
    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

Frishert, M., Cleophas, L.G., Watson, B.W. (2003). The Effect of Rewriting Regular Expressions on Their Accepting Automata. 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_31

Download citation

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

  • 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