From regular expressions to deterministic automata
Theoretical Computer Science
Complete systems of B -rational identities
Theoretical Computer Science
Regular expressions into finite automata
Theoretical Computer Science
Partial derivatives of regular expressions and finite automaton constructions
Theoretical Computer Science
Local languages and the Berry-Sethi algorithm
Theoretical Computer Science
Derivatives of Regular Expressions
Journal of the ACM (JACM)
Characterization of Glushkov automata
Theoretical Computer Science
Programming Techniques: Regular expression search algorithm
Communications of the ACM
Translating regular expressions into small εe-free nondeterministic finite automata
Journal of Computer and System Sciences
Automata, Languages, and Machines
Automata, Languages, and Machines
Theory of Computation: A Primer
Theory of Computation: A Primer
Canonical derivatives, partial derivatives and finite automaton constructions
Theoretical Computer Science
Glushkov Construction for Multiplicities
CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
Constructing NFA s by Optimal Use of Positions in Regular Expressions
CPM '02 Proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching
Derivatives of rational expressions with multiplicity
Theoretical Computer Science
Elements of Automata Theory
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
Approximation to the smallest regular expression for a given regular language
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
Finite Automata, Digraph Connectivity, and Regular Expression Size
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Construction of Tree Automata from Regular Expressions
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
A New Family of Regular Operators Fitting with the Position Automaton Computation
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
On the Average Size of Glushkov's Automata
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Series-Parallel Automata and Short Regular Expressions
Fundamenta Informaticae
Short Regular Expressions from Finite Automata: Empirical Results
CIAA '09 Proceedings of the 14th International Conference on Implementation and Application of Automata
Optimal lower bounds on regular expression size using communication complexity
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
The complexity of regular(-like) expressions
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Chop operations and expressions: descriptional complexity considerations
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Series-Parallel Automata and Short Regular Expressions
Fundamenta Informaticae
| Hi-index | 0.00 |
This survey paper reviews the means that allow to go from one representation of the languages to the other and how, and to what extend, one can keep them small. Some emphasis is put on the comparison between the expressions that can be computed from a given automaton and on the construction of the derived term automaton of an expression.