Efficient transformations from regular expressions to finite automata

Authors:
Sebastian Seibert
Affiliations:
Lehrstuhl für Informatik I Algorithms and Complexity, RWTH Aachen, Aachen, Germany
Venue:
DLT'02 Proceedings of the 6th international conference on Developments in language theory
Year:
2002

Citing 6
Cited 0

Partial derivatives of regular expressions and finite automaton constructions

Theoretical Computer Science
Derivatives of Regular Expressions

Journal of the ACM (JACM)
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
Translating Regular Expressions into Small epsilon-Free Nondeterministic Finite Automata

STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science
Translation of binary regular expressions into nondeterministic ɛ-free automata with O(n log n)transitions

Journal of Computer and System Sciences
Ambiguity in Graphs and Expressions

IEEE Transactions on Computers

Quantified Score

Hi-index	0.00

Visualization

Abstract

We examine several methods to obtain nondeterministic finite automata without Ɛ-transitions (NFA) from regular expressions. The focus is on the size (number of transitions) of the resulting automata, and on the time complexity of the transformation. We show how recent developments [9,6] have improved the size of the resulting automaton from O(n2) to O(n(log n)2), and even O(n log n) for bounded alphabet size (where n is the size of the regular expression). A lower bound [11] shows this to be close to optimal, and also one of those constructions can be computed in optimal time [8].