Parsing theory. Vol. 1: languages and parsing
Parsing theory. Vol. 1: languages and parsing
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
Optimal Simulations between Unary Automata
SIAM Journal on Computing
Translating Regular Expressions into Small epsilon-Free Nondeterministic Finite Automata
STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science
Formal languages and their relation to automata
Formal languages and their relation to automata
Comparing the size of NFAs with and without ε-transitions
Theoretical Computer Science
Transition complexity of language operations
Theoretical Computer Science
On the Hardness of Determining Small NFA's and of Proving Lower Bounds on Their Sizes
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Deciding determinism of caterpillar expressions
Theoretical Computer Science
Efficient transformations from regular expressions to finite automata
DLT'02 Proceedings of the 6th international conference on Developments in language theory
Deterministic caterpillar expressions
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
The complexity of regular(-like) expressions
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Regular language constrained sequence alignment revisited
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Regular expressions and NFAs without Ε-transitions
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
| Hi-index | 0.00 |
We show that every regular expression of size n over a fixed alphabet of s symbols can be converted into a nondeterministic ε-free finite-state automaton with O(sn log n) transitions (edges). In case of binary regular languages, this improves the previous known conversion from O(n(log n)2) transitions to O(n log n). For the general case with no bound on cardinality of the input alphabet, our conversion yields a better constant factor in the O(n(log n)2) term. The number of states is bounded by O(n).