Advertisement

Recognizing regular expressions by means of dataflow networks

  • Pascal Raymond
Session 7: Automata
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1099)

Abstract

This paper addresses the problem of building a Boolean dataflow network (sequential circuit) recognizing the language described by a regular expression. The main result is that both the construction time and the size of the resulting network are linear with respect to the size of the regular expression.

Keywords

Regular Expression Regular Language Boolean Network Finite Automaton Sequential Circuit 
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.
    A. V. Aho. Algorithms for finding patterns in strings. In J. van Leeuwen, editor, Handbook of theoretical computer science, chapter 5, pages 257–300. Elsevier Science Publishers B. V., 1990.Google Scholar
  2. 2.
    V. Antimirov. Partial derivatives of regular expressions and finite automata constructions. In E. W. Mayr and C. Puech, editors, Proceedings of STACS '95, pages 455–466, Munich, Germany, March 1995. LNCS 900, Springer Verlag.Google Scholar
  3. 3.
    G. Berry and R. Sethi. From regular expressions to deterministic automata. Theoretical Computer Science, 48:117–126, 1986.Google Scholar
  4. 4.
    J. A. Brzozowski. Derivatives of regular expressions. Journal of the ACM, 11(4):481–494, October 1964.Google Scholar
  5. 5.
    J. A. Brzozowski and E. Leiss. On equations for regular languages, finite automata, and sequential networks. Theoretical Computer Science, 10:19–35, 1980.CrossRefGoogle Scholar
  6. 6.
    C. H. Chang and R. Paige. From regular expressions to DFA's using compressed NFA's. In Apostolico, Crochemore, Gaul, and Manber, editors, Combinatorial Pattern Matching. Proceedings, pages 88–108. LNCS 644, Springer Verlag, 1992.Google Scholar
  7. 7.
    R. W. Floyd and J. D. Ullman. The compilation of regular expressions into integrated circuits. Journal of the ACM, 29(3):603–622, 1982.Google Scholar
  8. 8.
    N. Halbwachs. Synchronous programming of reactive systems. Kluwer Academic Pub., 1993.Google Scholar
  9. 9.
    N. Halbwachs, F. Lagnier, and P. Raymond. Synchronous observers and the verification of reactive systems. In M. Nivat, C. Rattray, T. Rus, and G. Scollo, editors, Third Int. Conf. on Algebraic Methodology and Software Technology, AMAST'93, Twente, June 1993. Workshops in Computing, Springer Verlag.Google Scholar
  10. 10.
    R. McNaughton and H. Yamada. Regular expressions and state graphs for automata. IEEE Trans. on Electronic Computers, 9(1):39–47, 1960.Google Scholar
  11. 11.
    K. Thompson. Regular expression search algorithm. Communications of the ACM, 11(6):419–423, June 1968.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Pascal Raymond
    • 1
  1. 1.VERIMAG, Miniparc ZIRSTMartinFrance

Personalised recommendations