An efficient null-free procedure for deciding regular language membership

Theoretical Computer Science

Volumn 231, Issue 1, 2000, Pages 89-101

  Ponty, J L ^a  

^a FRE CNRS 2829   (France)

Author keywords

Automata theory; Glushkov construction; Regular expressions; String matching

Indexed keywords

EID: 0003649512     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(99)00019-5     Document Type: Article

References (27)

1. A.V. Aho, Algorithms for finding patterns in strings, in: J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science, Algorithms and Complexity, vol. A, Ch. 5, Elsevier, Amsterdam, 1990, pp. 255-300.
2. A.V. Aho, M.J. Corašick, Efficient string matching: an aid to bibliographic search, Commun. ACM 18(6) (1975) 333-340.
3. A.V. Aho, R. Sethi, J.D. Ullman, Compilers - Principles, Techniques and Tools, Addison-Wesley, Reading, MA, 1986.
4. V. Antimirov, Partial derivatives of regular expressions and finite automaton constructions, Theoret. Comput. Sci. 155 (1996) 291-319.
5. D. Beauquier, J. Berstel, P. Chrétienne, Éléments d'Algorithmique, Masson, Paris, 1992.
6. G. Berry, R. Sethi, From regular expressions to deterministic automata, Theoret. Comput. Sci. 48(1) (1986) 117-126.
7. A. Brüggemann-Klein, Regular expressions into finite automata, Theoret. Comput. Sci. 120(1) (1993) 197-213.
8. A. Brüggemann-Klein, D. Wood, Deterministic regular languages, in A. Finkel, M. Jantzen (Eds.), Proc. 9th Annual Symp. on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science, vol. 577, Springer, Berlin, 1992, pp. 173-184.
9. C.-H. Chang, R. Paige, From regular expressions to DFA's using NFA's, in A. Apostolico, M. Crochemore, Z. Galil, U. Manber (Eds.), Proc. 3rd Annual Symp. on Combinatorial Pattern Matching, Lecture Notes in Computer Science, vol. 664, Tucson, AZ, Springer, Berlin, 1992, pp. 90-110.
10. M. Crochemore, C. Hancart, Automata for matching patterns, in: G. Rozenberg, A. Salomaa (Eds.), Handbook of Formal Languages, vol. II, Linear Modeling: Background and Application, Springer, Berlin, 1997, pp. 399-462
11. M.D. Davis, R. Sigal, E.J. Weyuker, Computability, Complexity, and Languages, Fundamentals of Theoretical Computer Science, Academic Press, New york, 1994.
12. V.M. Glushkov, The abstract theory of automata, Russian Math. Surveys 16 (1961) 1-53.
13. C. Hancart, On Simon's string searching algorithm, Inform. Process. Lett. 47(2) (1993) 95-99.
14. J.E. Hopcroft, J.D. Ullman, Introduction to Automata Theory, Languages and Computation, Addison-Wesley, Reading, MA, 1979.
15. J. Hromkovič, S. Seibert, T. Wilke, Translating regular expressions into small ε-free nondeterministic finite automata, in: R. Reischuk, M. Morvan (Eds.), STACS 97, 14th Annual Symp. on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science, vol. 1200, Lübeck, Germany, February 27-March 1, Springer, Berlin, 1997, pp. 55-66.
16. S. Kleene, Representation of events in nerve nets and finite automata, in: Automata Studies, Ann. Math. Stud., vol. 34, Princeton Univ. Press, Princeton, 1956, pp. 3-41.
17. D.E. Knuth, J.H. Morris, V.R. Pratt, Fast pattern matching in strings, SIAM J. Comput. 6(2) (1977) 323-350.
18. O. Matz, A. Miller, A. Potthoff, W. Thomas, E. Valkena, Report on the program AMoRE, Report, Institut für informatik und praktische mathematik, Christian-Albrechts Universität, Kiel, 1995.
19. B.G. Mirkin, An algorithm for constructing a base in a language of regular expressions, Eng. Cybernet. 5 (1966) 110-116.
20. M. Mohri, Matching patterns of an automaton, in: Z. Galil, E. Ukkonen (Eds.), Proc. 6th Annual Symp. on Combinatorial Pattern Matching, Lecture Notes in Computer Science, vol. 937, Espoo, Finland, Springer, Berlin, 1995, pp. 286-297.
21. D. Perrin, Finite automata, in: J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science, Formal Models and Semantics, vol. B, Elsevier, Amsterdam, 1990, pp. 1-57.
22. J.-L. Ponty, Algorithmique et Implémentation des Automates, Contribution au Développement du Logiciel AUTOMATE, Ph.D. Thesis, LIR, Université de Rouen, France, 1997, Rapport LIR TH97.03.
23. J.-L. Ponty, D. Ziadi, J.-M. Champarnaud, A new quadratic algorithm to convert a regular expression into an automaton, in: D. Raymond, D. Wood, S. Yu (Eds.), Automata Implementation: First International Workshop on Implementing Automata, WIA'96, Lecture Notes in Computer Science, vol. 1260, London, Ontario, Springer, Berlin, 1997, pp. 109-119.
24. I. Simon, Piecewise testable events, in Proc. 2nd GI Conf., Lecture Notes in Computer Science, vol. 33, Springer, Berlin, 1975, pp. 214-222.
25. K. Thompson, Regular expression search algorithm, Commun. ACM 11(6) (1968) 419-422.
26. D. Wood, Theory of Computation, Wiley, New York, 1987.
27. D. Ziadi, J.-L. Ponty, J.-M. Champarnaud, Passage d'une expression rationnelle à un automate fini non-déterministe, Bull. Belg. Math. Soc. 4 (1997) 177-203.