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
Automata for matching patterns
Handbook of formal languages, vol. 2
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
Algorithms for Computing Small NFAs
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Reducing NFAs by invariant equivalences
Theoretical Computer Science
Information and Computation
Random generation models for NFA'S
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the fourth international workshop on descriptional complexity of formal systems
Construction of Tree Automata from Regular Expressions
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
On the Average Size of Glushkov's Automata
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
The effect of rewriting regular expressions on their accepting automata
CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
Fuzzy relation equations and reduction of fuzzy automata
Journal of Computer and System Sciences
Computing the follow automaton of an expression
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
The language, the expression, and the (small) automaton
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
Construction of fuzzy automata from fuzzy regular expressions
Fuzzy Sets and Systems
| Hi-index | 0.00 |
We give two new algorithms for constructing small nondeterministic finite automata (NFA) from regular expressions. The first constructs NFAs with 驴-moves (驴NFA) which are smaller than all the other 驴NFAs obtained by similar constructions. Their size is at most 3/2 |驴|+ 5/2, where 驴 is the regular expression. The second constructs NFAs. It uses 驴-elimination in the 驴NFAs we just introduced and builds a quotient of the well-known position automaton. Our NFA is always smaller and faster to compute than the position automaton. It uses optimally the information from the positions of a regular expression.