Inference of concise DTDs from XML data
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
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
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
Multi-tilde Operators and Their Glushkov Automata
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Implementation of State Elimination Using Heuristics
CIAA '09 Proceedings of the 14th International Conference on Implementation and Application of Automata
Short Regular Expressions from Finite Automata: Empirical Results
CIAA '09 Proceedings of the 14th International Conference on Implementation and Application of Automata
Small Extended Expressions for Acyclic Automata
CIAA '09 Proceedings of the 14th International Conference on Implementation and Application of Automata
Inference of concise regular expressions and DTDs
ACM Transactions on Database Systems (TODS)
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
Acyclic automata and small expressions using multi-tilde-bar operators
Theoretical Computer Science
The language, the expression, and the (small) automaton
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
Shorter regular expressions from finite-state automata
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
State Elimination Heuristics for Short Regular Expressions
Fundamenta Informaticae
| Hi-index | 0.00 |
A regular expression that represents the language accepted by a given finite automaton can be obtained using the the state elimination algorithm. The order of vertex removal affects the size of the resulting expression. We use here an heuristic to compute an approximation to the order of vertex removal that leads to the smallest regular expression obtainable this way.