From regular expressions to DFA's using compressed NFA's
- 1 January 1992
- book chapter
- Published by Springer Nature
- Vol. 178, 90-110
- https://doi.org/10.1007/3-540-56024-6_8
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- From regular expressions to deterministic automataTheoretical Computer Science, 1986
- Pattern Matching in StringsPublished by Elsevier ,1980
- 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
- Linear automaton transformationsProceedings of the American Mathematical Society, 1958
- Representation of Events in Nerve Nets and Finite AutomataPublished by Walter de Gruyter GmbH ,1956