Advertisement

The Effect of Rewriting Regular Expressions on Their Accepting Automata

  • Michiel Frishert
  • Loek G. Cleophas
  • Bruce W. Watson
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2759)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Hopcroft, J., Ullman, J.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley (1979)Google Scholar
  2. [2]
    Thompson, K.: Regular Expression Search Algorithm. Communications of the ACM 11(6) (1968) 419–422zbMATHCrossRefGoogle Scholar
  3. [3]
    Glushkov, V.M.: The Abstract Theory of Automata. Russian Math. Surveys 16 (1961) 1–53CrossRefGoogle Scholar
  4. [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–288Google Scholar
  5. [5]
    Frishert, M., Watson, B.W.: The Effect of Rewriting Regular Expressions on Their Accepting Automata. Technical report, Technische Universiteit Eindhoven (2003)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Michiel Frishert
    • 1
  • Loek G. Cleophas
    • 1
  • Bruce W. Watson
    • 2
  1. 1.Department of Mathematics and Computer ScienceTechnische Universiteit EindhovenEindhovenThe Netherlands
  2. 2.Department of Computer ScienceUniversity of PretoriaPretoriaSouth Africa

Personalised recommendations