Regular expressions into finite automata
Theoretical Computer Science
Handbook of formal languages, vol. 1
An efficient null-free procedure for deciding regular language memebership
Theoretical Computer Science - Special issue on implementing automata
Programming Techniques: Regular expression search algorithm
Communications of the ACM
Data Structures and Algorithms
Data Structures and Algorithms
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
Determinization of Glushkov Automata
WIA '98 Revised Papers from the Third International Workshop on Automata Implementation
From Regular Expressions to DFA's Using Compressed NFA's
CPM '92 Proceedings of the Third Annual Symposium on Combinatorial Pattern Matching
| Hi-index | 0.00 |
The aim of this paper is to compare three efficient representations of the position automaton of a regular expression: the Thompson Ɛ-automaton, the ZPC-structure and the F-structure, an optimization of the ZPC-structure. These representations are linear w.r.t. the size s of the expression, since their construction is in O(s) space and time, as well as the computation of the set δ(X, a) of the targets of the transitions by a of any subset X of states. The comparison is based on the evaluation of the number of edges of the underlying graphs respectively created by the construction step or visited by the computation of a set δ(X, a).