SIAM Journal on Computing
One-unambiguous regular languages
Information and Computation
Programming Techniques: Regular expression search algorithm
Communications of the ACM
Theory of Computation: A Primer
Theory of Computation: A Primer
Introduction to Automata Theory, Languages and Computability
Introduction to Automata Theory, Languages and Computability
Regular expressions: new results and open problems
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the fourth international workshop on descriptional complexity of formal systems
JFLAP: An Interactive Formal Languages and Automata Package
JFLAP: An Interactive Formal Languages and Automata Package
Obtaining shorter regular expressions from finite-state automata
Theoretical Computer Science
Provably Shorter Regular Expressions from Deterministic Finite Automata
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
The equivalence problem for regular expressions with squaring requires exponential space
SWAT '72 Proceedings of the 13th Annual Symposium on Switching and Automata Theory (swat 1972)
Series-Parallel Automata and Short Regular Expressions
Fundamenta Informaticae
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
| Hi-index | 0.00 |
State elimination is an intuitive and easy-to-implement algorithm that computes a regular expression from a finite-state automaton (FA). The size of a regular expression from state elimination depends on the state removal sequence. Note that it is very hard to compute the shortest regular expression for a given FA in general and we cannot avoid the exponential blow-up from state elimination. Nevertheless, we notice that we may have a shorter regular expression if we choose a good removal sequence. This observation motivates us to examine heuristics based on the structural properties of an FA and implement state elimination using the heuristics that run in polynomial time. We demonstrate the effectiveness of our algorithm by experiments.