From regular expressions to deterministic automata
Theoretical Computer Science
Parsing theory. Vol. 1: languages and parsing
Parsing theory. Vol. 1: languages and parsing
Regular expressions into finite automata
Theoretical Computer Science
Partial derivatives of regular expressions and finite automaton constructions
Theoretical Computer Science
From regular expressions to DFA's using compressed NFA's
Theoretical Computer Science
Mastering regular expressions
Handbook of formal languages, vol. 1
Derivatives of Regular Expressions
Journal of the ACM (JACM)
Programming Techniques: Regular expression search algorithm
Communications of the ACM
Translating regular expressions into small εe-free nondeterministic finite automata
Journal of Computer and System Sciences
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
New Finite Automaton Constructions Based on Canonical Derivatives
CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
Computing the Equation Automaton of a Regular Expression in Space and Time
CPM '01 Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching
Constructing NFA s by Optimal Use of Positions in Regular Expressions
CPM '02 Proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching
Reducing NFAs by invariant equivalences
Theoretical Computer Science
Information and Computation
NFA reduction algorithms by means of regular inequalities
Theoretical Computer Science - Developments in language theory
Regular expressions: new results and open problems
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the fourth international workshop on descriptional complexity of formal systems
Inductive bases and their application to searches for minimal unary NFAs
Proceedings of the 44th annual Southeast regional conference
Regular expressions: new results and open problems
Journal of Automata, Languages and Combinatorics
A family of NFAS free of state reductions
Journal of Automata, Languages and Combinatorics
NFA reduction algorithms by means of regular inequalities
DLT'03 Proceedings of the 7th international conference on Developments in language theory
Fuzzy relation equations and reduction of fuzzy automata
Journal of Computer and System Sciences
Reducing nondeterministic finite automata with SAT solvers
FSMNLP'09 Proceedings of the 8th international conference on Finite-state methods and natural language processing
Bisimulations for fuzzy automata
Fuzzy Sets and Systems
Succinctness of the Complement and Intersection of Regular Expressions
ACM Transactions on Computational Logic (TOCL)
Reducing the size of NFAs by using equivalences and preorders
CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
Visualising larger state spaces in ProB
ZB'05 Proceedings of the 4th international conference on Formal Specification and Development in Z and B
Computing the follow automaton of an expression
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
Construction of fuzzy automata from fuzzy regular expressions
Fuzzy Sets and Systems
Factorization of fuzzy automata
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
Nondeterministic automata: Equivalence, bisimulations, and uniform relations
Information Sciences: an International Journal
| Hi-index | 0.00 |
We give new methods for constructing small nondeterministic finite automata (NFA) from regular expressions or from other NFAs. Given an arbitrary NFA, we compute the largest right-invariant equivalence on the states and then merge the states in the same class to obtain a smaller automaton. When applying this method to position automata, we get a way to convert regular expressions into NFAs which can be arbitrarily smaller than the position, partial derivative, and follow automata. In most cases, it is smaller than all NFAs obtained by similar constructions.