Reducing NFAs by invariant equivalences
- 5 September 2003
- journal article
- Published by Elsevier BV in Theoretical Computer Science
- Vol. 306 (1-3), 373-390
- https://doi.org/10.1016/s0304-3975(03)00311-6
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Follow automataInformation and Computation, 2003
- Translating Regular Expressions into Small ε-Free Nondeterministic Finite AutomataJournal of Computer and System Sciences, 2001
- Computingϵ-Free NFA from Regular Expressions inO(nlog2(n)) TimeRAIRO - Theoretical Informatics and Applications, 2000
- From regular expressions to DFA's using compressed NFA'sTheoretical Computer Science, 1997
- Regular LanguagesPublished by Springer Science and Business Media LLC ,1997
- Partial derivatives of regular expressions and finite automaton constructionsTheoretical Computer Science, 1996
- Regular expressions into finite automataTheoretical Computer Science, 1993
- From regular expressions to deterministic automataTheoretical Computer Science, 1986
- Derivatives of Regular ExpressionsJournal of the ACM, 1964
- THE ABSTRACT THEORY OF AUTOMATARussian Mathematical Surveys, 1961