On NFA Reductions
- 1 January 2004
- book chapter
- other
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
Abstract
No abstract availableThis publication has 21 references indexed in Scilit:
- Reducing NFAs by invariant equivalencesTheoretical Computer Science, 2003
- NFA Reduction Algorithms by Means of Regular InequalitiesLecture Notes in Computer Science, 2003
- Algorithms for Computing Small NFAsLecture Notes in Computer Science, 2002
- 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
- Minimal NFA Problems are HardSIAM Journal on Computing, 1993
- Regular expressions into finite automataTheoretical Computer Science, 1993
- AN n log n ALGORITHM FOR MINIMIZING STATES IN A FINITE AUTOMATONPublished by Elsevier BV ,1971
- On the State Minimization of Nondeterministic Finite AutomataIEEE Transactions on Computers, 1970
- THE ABSTRACT THEORY OF AUTOMATARussian Mathematical Surveys, 1961