From regular expressions to DFA's using compressed NFA's
- 30 May 1997
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 178 (1-2) , 1-36
- https://doi.org/10.1016/s0304-3975(96)00140-5
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Using multiset discrimination to solve language processing problems without hashingTheoretical Computer Science, 1995
- Regular expressions into finite automataTheoretical Computer Science, 1993
- From regular expressions to DFA's using compressed NFA'sPublished by Springer Nature ,1992
- From regular expressions to deterministic automataTheoretical Computer Science, 1986
- The UNIX time-sharing systemCommunications of the ACM, 1974
- Programming Techniques: Regular expression search algorithmCommunications of the ACM, 1968
- On the translation of languages from left to rightInformation and Control, 1965
- Derivatives of Regular ExpressionsJournal of the ACM, 1964
- Regular Expressions and State Graphs for AutomataIEEE Transactions on Electronic Computers, 1960
- Finite Automata and Their Decision ProblemsIBM Journal of Research and Development, 1959