Publisher
Springer Berlin Heidelberg
Reference19 articles.
1. Aho, A., Sethi, R., Ullman, J., Compilers: Principles, Techniques, and Tools, Addison-Wesley, MA, 1988.
2. Antimirov, V., Partial derivatives of regular expressions and finite automaton constructions, Theoret. Comput. Sci.
155 (1996) 291–319.
3. Berry, G, Sethi, R., From regular expressions to deterministic automata, Theoret. Comput. Sci.
48 (1986) 117–126.
4. Brüggemann-Klein, A., Regular expressions into finite automata, Theoret. Comput. Sci.
120 (1993) 197–213.
5. Brzozowski, J., Derivatives of regular expressions, J. ACM
11 (1964) 481–494.
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Construction of tree automata from regular expressions;RAIRO - Theoretical Informatics and Applications;2011-07
2. On the Average Size of Glushkov’s Automata;Language and Automata Theory and Applications;2009
3. The Language, the Expression, and the (Small) Automaton;Implementation and Application of Automata;2006
4. Computing the Follow Automaton of an Expression;Implementation and Application of Automata;2005
5. Reducing NFAs by invariant equivalences;Theoretical Computer Science;2003-09