Monotone separation of logarithmic space from logarithmic depth
Journal of Computer and System Sciences
GOTO removal based on regular expressions
Journal of Software Maintenance: Research and Practice
Communication complexity
Two Complete Axiom Systems for the Algebra of Regular Events
Journal of the ACM (JACM)
Introduction to Automata Theory, Languages and Computability
Introduction to Automata Theory, Languages and Computability
Obtaining shorter regular expressions from finite-state automata
Theoretical Computer Science
Regular expressions: new results and open problems
Journal of Automata, Languages and Combinatorics
Economy of description by automata, grammars, and formal systems
SWAT '71 Proceedings of the 12th Annual Symposium on Switching and Automata Theory (swat 1971)
A new rank technique for formula size lower bounds
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Regular expressions and NFAs without Ε-transitions
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
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
The language, the expression, and the (small) automaton
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
Acyclic automata with easy-to-find short regular expressions
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
Succinctness of Regular Expressions with Interleaving, Intersection and Counting
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Provably Shorter Regular Expressions from Deterministic Finite Automata
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Simplifying XML schema: effortless handling of nondeterministic regular expressions
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Language operations with regular expressions of polynomial size
Theoretical Computer Science
Probabilistic Reachability for Parametric Markov Models
Proceedings of the 16th International SPIN Workshop on Model Checking Software
Short Regular Expressions from Finite Automata: Empirical Results
CIAA '09 Proceedings of the 14th International Conference on Implementation and Application of Automata
Succinctness of regular expressions with interleaving, intersection and counting
Theoretical Computer Science
The complexity of regular(-like) expressions
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Succinctness of the Complement and Intersection of Regular Expressions
ACM Transactions on Computational Logic (TOCL)
Simplifying regular expressions: a quantitative perspective
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Descriptional complexity of deterministic regular expressions
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Hi-index | 0.00 |
The problem of converting deterministic finite automata into (short) regular expressions is considered. It is known that the required expression size is 2Θ(n) in the worst case for infinite languages, and for finite languages it is nΩ(log log n) and nO(log n), if the alphabet size grows with the number of states n of the given automaton. A new lower bound method based on communication complexity for regular expression size is developed to show that the required size is indeed nΘ(log n). For constant alphabet size the best lower bound known to date is Ω(n2), even when allowing infinite languages and nondeterministic finite automata. As the technique developed here works equally well for deterministic finite automata over binary alphabets, the lower bound is improved to nΩ(log n).