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
Handbook of formal languages, vol. 1
Subset construction complexity for homogeneous automata, position automata and ZPC-structures
Theoretical Computer Science
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
Algorithms for Computing Small NFAs
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations 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
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
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
A unified construction of the glushkov, follow, and antimirov automata
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
The language, the expression, and the (small) automaton
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
| Hi-index | 0.00 |
Small nondeterministic recognizers are very useful in practical applications based on regular expression searching. The follow automaton, recently introduced by Ilie and Yu, is such a small recognizer, since it is a quotient of the position automaton. The aim of this paper is to present an efficient computation of this quotient, based on specific properties of the $\mathcal{ZPC}$ of the expression. The motivation is twofold. Since this structure is already a basic tool for computing the position automaton, Antimirov’s automaton and Hromkovic’s automaton, the design of an algorithm for computing the follow automaton via this structure makes it easier to compare all these small recognizers. Secondly such an algorithm provides a straightforward alternative to the rather sophisticated handling of ε-transitions used in the original algorithm.