A separator theorem for graphs of bounded genus
Journal of Algorithms
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
An extension of Khrapchenko's theorem
Information Processing Letters
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
On a question of A. Salomaa: the equational theory of regular expression
Theoretical Computer Science
Journal of the ACM (JACM)
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
An Improved Algorithm for the Membership Problem for Extended Regular Expressions
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
Errata to: "finite automata and unary languages"
Theoretical Computer Science
Constructing a finite automaton for a given regular expression
ACM SIGACT News
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
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
The Frobenius Problem and Its Generalizations
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
The Average State Complexity of the Star of a Finite Set of Words Is Linear
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
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
State complexity of unique rational operations
Theoretical Computer Science
Series-Parallel Automata and Short Regular Expressions
Fundamenta Informaticae
Language operations with regular expressions of polynomial size
Theoretical Computer Science
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
On NFAs where all states are final, initial, or both
Theoretical Computer Science
Standardized interoperable image retrieval
Proceedings of the 2010 ACM Symposium on Applied Computing
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
On the hardness of the noncommutative determinant
Proceedings of the forty-second ACM symposium on Theory of computing
Succinctness of regular expressions with interleaving, intersection and counting
Theoretical Computer Science
Acyclic automata and small expressions using multi-tilde-bar operators
Theoretical Computer Science
The complexity of regular(-like) expressions
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Decision problems for convex languages
Information and Computation
Lower bounds for context-free grammars
Information Processing Letters
Partial derivatives of an extended regular expression
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Decidability and shortest strings in formal languages
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
Succinctness of the Complement and Intersection of Regular Expressions
ACM Transactions on Computational Logic (TOCL)
On the state complexity of combined operations
CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
Complexity of operations on cofinite languages
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Simplifying regular expressions: a quantitative perspective
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
State complexity of kleene-star operations on trees
WTCS'12 Proceedings of the 2012 international conference on Theoretical Computer Science: computation, physics and beyond
Series-Parallel Automata and Short Regular Expressions
Fundamenta Informaticae
State Elimination Heuristics for Short Regular Expressions
Fundamenta Informaticae
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.