Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
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
From regular expressions to DFA's using compressed NFA's
Theoretical Computer Science
Programming Techniques: Regular expression search algorithm
Communications of the ACM
Semiring frameworks and algorithms for shortest-distance problems
Journal of Automata, Languages and Combinatorics
A New Quadratic Algorithm to Convert a Regular Expression into an Automaton
WIA '96 Revised Papers from the First International Workshop on Implementing Automata
Fast Regular Expression Search
WAE '99 Proceedings of the 3rd International Workshop on Algorithm Engineering
Computing the Equation Automaton of a Regular Expression in Space and Time
CPM '01 Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching
Information and Computation
Finite-state transducers in language and speech processing
Computational Linguistics
Derivatives of rational expressions with multiplicity
Theoretical Computer Science
From regular weighted expressions to finite automata
CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
Computing the follow automaton of an expression
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
Fault-tolerant computation of distributed regular path queries
Theoretical Computer Science
Preferential Regular Path Queries
Fundamenta Informaticae
An Efficient Computation of the Equation K-automaton of a Regular K-expression
Fundamenta Informaticae
An efficient computation of the equation K-automaton of a regular K-expression
DLT'07 Proceedings of the 11th international conference on Developments in language theory
A play on regular expressions: functional pearl
Proceedings of the 15th ACM SIGPLAN international conference on Functional programming
The complexity of regular(-like) expressions
DLT'10 Proceedings of the 14th international conference on Developments in language theory
An Efficient Computation of the Equation K-automaton of a Regular K-expression
Fundamenta Informaticae
Preferential Regular Path Queries
Fundamenta Informaticae
Regular expression sub-matching using partial derivatives
Proceedings of the 14th symposium on Principles and practice of declarative programming
Distributed multi-source regular path queries
ISPA'07 Proceedings of the 2007 international conference on Frontiers of High Performance Computing and Networking
Adding pebbles to weighted automata
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
Theoretical Computer Science
Jaccie: A Java-based compiler-compiler for generating, visualizing and debugging compiler components
Science of Computer Programming
| Hi-index | 0.01 |
A number of different techniques have been introduced in the last few decades to create ε-free automata representing regular expressions such as the Glushkov automata, follow automata, or Antimirov automata. This paper presents a simple and unified view of all these construction methods both for unweighted and weighted regular expressions. It describes simpler algorithms with time complexities at least as favorable as that of the best previously known techniques, and provides a concise proof of their correctness. Our algorithms are all based on two standard automata operations: epsilon-removal and minimization. This contrasts with the multitude of complicated and special-purpose techniques previously described in the literature, and makes it straightforward to generalize these algorithms to the weighted case. In particular, we extend the definition and construction of follow automata to the case of weighted regular expressions over a closed semiring and present the first algorithm to compute weighted Antimirov automata.