Computing the Equation Automaton of a Regular Expression in O(s 2) Space and Time-Reference-Cited by-同舟云学术

Computing the Equation Automaton of a Regular Expression in O(s 2) Space and Time

Published:2001 Issue: Volume: Page:157-168
ISSN:0302-9743
Container-title:Combinatorial Pattern Matching
language:
Short-container-title:

Author:

Champarnaud Jean-Marc,Ziadi Djelloul

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-48194-X_15

Reference23 articles.

1. A.V. Aho, J.E. Hopcroft, and J.D. Ullman. Data Structures and Algorithms. Addison-Wesley, Reading, MA, 1983.

2. J.-M. Autebert et J.-M. Rifflet. Dérivations Formelles des Expressions Rxationnelles: Un Programme de Calcul Automatique. Rapport LITP 78(14), 1978.

3. V. Antimirov. Partial derivatives of regular expressions and finite automaton constructions. Theoret. Comput. Sci., 155:291–319, 1996.

4. D. Beauquier, J. Berstel, and P. Chrétienne. Éléments d’Algorithmique. Masson, Paris, 1992.

5. A. Brüggemann-Klein, Regular Expressions into Finite Automata. Theoret. Comput. Sci., 120 (1993), 197–213.

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Regex matching with counting-set automata;Proceedings of the ACM on Programming Languages;2020-11-13

2. Efficient weighted expressions conversion;RAIRO - Theoretical Informatics and Applications;2007-09-06

3. A Unified Construction of the Glushkov, Follow, and Antimirov Automata;Lecture Notes in Computer Science;2006

4. Computing the Follow Automaton of an Expression;Implementation and Application of Automata;2005

5. FROM REGULAR WEIGHTED EXPRESSIONS TO FINITE AUTOMATA;International Journal of Foundations of Computer Science;2004-10