A separator theorem for graphs of bounded genus
Journal of Algorithms
Finite automata and unary languages
Theoretical Computer Science
The maximum order of an element of a finite symmetric group
American Mathematical Monthly
A heuristic algorithm for small separators in arbitrary graphs
SIAM Journal on Computing
Intersection and union of regular languages and state complexity
Information Processing Letters
SIAM Journal on Computing
SIAM Journal on Discrete Mathematics
The state complexities of some basic operations on regular languages
Theoretical Computer Science
Grail: a C++ library for automata and expressions
Journal of Symbolic Computation - Special issue on “algorithms: implementation, libraries and use”
Regular expression for a language without empty word
Theoretical Computer Science
A lower bound technique for the size of nondeterministic finite automata
Information Processing Letters
Algorithmic number theory
Automaticity II: descriptional complexity in the unary case
Theoretical Computer Science
Separating Exponentially Ambiguous Finite Automata from Polynomially Ambiguous Finite Automata
SIAM Journal on Computing
Journal of the ACM (JACM)
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Algorithms for Computing Small NFAs
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
On the number of distinct languages accepted by finite automata with n states
Journal of Automata, Languages and Combinatorics - Third international workshop on descriptional complexity of automata, grammars and related structures
A polylogarithmic approximation of the minimum bisection
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Constructing a finite automaton for a given regular expression
ACM SIGACT News
Transition complexity of language operations
Theoretical Computer Science
Generating all permutations by context-free grammars in Greibach normal form
Theoretical Computer Science
Insecure context switching: inoculating regular expressions for survivability
WOOT'08 Proceedings of the 2nd conference on USENIX Workshop on offensive technologies
State Complexity of Combined Operations for Prefix-Free Regular Languages
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
The complexity of query containment in expressive fragments of XPath 2.0
Journal of the ACM (JACM)
Implementation of State Elimination Using Heuristics
CIAA '09 Proceedings of the 14th International Conference on Implementation and Application of Automata
Detecting palindromes, patterns and borders in regular languages
Information and Computation
Tagging stream data for rich real-time services
Proceedings of the VLDB Endowment
State complexity of union and intersection of finite languages
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Robust and fast pattern matching for intrusion detection
INFOCOM'10 Proceedings of the 29th conference on Information communications
Enumerating regular expressions and their languages
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
FUN'12 Proceedings of the 6th international conference on Fun with Algorithms
Descriptional complexity of deterministic regular expressions
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
| Hi-index | 0.00 |
Regular expressions have been studied for nearly 50 years, yet many intriguing problems about their descriptive capabilities remain open. In this paper we sketch some new results and discuss what remains to be solved.