Advertisement

FIRE Station: An Environment for Manipulating Finite Automata and Regular Expression Views

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

Abstract

We discuss a new tool, FIRE Station, for the visualization, exploration and manipulation of regular languages and their various representations, including regular expressions and finite state automata.

Keywords

Regular Expression Intrusion Detection System Regular Language Fire Station Parse Tree 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Brzozowski, J.A.: Derivatives of Regular Expressions. Journal of the ACM 11, 481–494 (1964)zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Antimirov, V.: Partial derivatives of regular expressions and finite automata constructions. In: Mayr, E.W., Puech, C. (eds.) STACS 1995. LNCS, vol. 900, pp. 455–466. Springer, Heidelberg (1995)Google Scholar
  3. 3.
    Frishert, M., Cleophas, L., Watson, B.W.: The Effect of Rewriting Regular Expressions on Their Accepting Automata. In: Ibarra, O.H., Dang, Z. (eds.) CIAA 2003. LNCS, vol. 2759, pp. 304–305. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  4. 4.
    Watson, B.: An incremental DFA minimization algorithm. In: Karttunen, L., Koskenniemi, K., van Noord, G. (eds.) Proceedings of FSMNLP 2001, ESSLLI workshop, Helsinki (2001)Google Scholar
  5. 5.
    Battista, G.D., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice-Hall, Englewood Cliffs (1999)zbMATHGoogle Scholar
  6. 6.
    Caron, P., Ziadi, D.: Characterization of glushkov automata. Theor. Comput. Sci. 233, 75–90 (2000)zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Ngassam, E.K., Watson, B.W., Kourie, D.G.: Hardcoding finite state automata processing. In: Annual Conference of the South African Institute of Computer Scientists and Information Technologists, Proceedings, Fourways, South Africa, pp. 111–121 (2003)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Michiel Frishert
    • 1
  • Loek Cleophas
    • 1
  • Bruce W. Watson
    • 1
  1. 1.Department of Mathematics and Computer ScienceTechnische Universiteit EindhovenEindhovenThe Netherlands

Personalised recommendations