Three partition refinement algorithms
SIAM Journal on Computing
From regular expressions to deterministic automata
Theoretical Computer Science
Regular expressions into finite automata
Theoretical Computer Science
Partial derivatives of regular expressions and finite automaton constructions
Theoretical Computer Science
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)
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Data Structures and Algorithms
Data Structures and Algorithms
Computing epsilon-Free NFA from Regular Expressions in O(n log²(n)) Time
MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
Translating Regular Expressions into Small epsilon-Free Nondeterministic Finite Automata
STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science
A New Quadratic Algorithm to Convert a Regular Expression into an Automaton
WIA '96 Revised Papers from the First International Workshop on Implementing Automata
New Finite Automaton Constructions Based on Canonical Derivatives
CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
From Regular Expressions to DFA's Using Compressed NFA's
CPM '92 Proceedings of the Third 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
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
From regular weighted expressions to finite 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
A unified construction of the glushkov, follow, and antimirov automata
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
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
| Hi-index | 0.00 |
Let E be a regular expression the size of which is s. Mirkin's prebases and Antimirov's partial derivatives lead to the construction of the same automaton, called the equation automaton of E. The number of states in this automaton is less than or equal to the number of states in the position automaton. On the other hand, it can be computed by Antimirov's algorithm with an O(s5) time complexity, whereas there exist O(s2) implementations for the position automaton. We present an O(s2) space and time algorithm to compute the equation automaton. It is based on the notion of canonical derivative which is related both to word and partial derivatives. This work is tightly connected to pattern matching area since the aim is, given a regular expression, to produce an as small as possible recognizer with the best space and time complexity.