Formal languages and their relation to automata
Formal languages and their relation to automata
Star height of certain families of regular events
Journal of Computer and System Sciences
On the Complexity of Decidable Cases of Commutation Problem for Languages
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Recursive XML Schemas, Recursive XML Queries, and Relational Storage: XML-to-SQL Query Translation
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
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
More Concise Representation of Regular Languages by Automata and Regular Expressions
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
Short Regular Expressions from Finite Automata: Empirical Results
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)
More concise representation of regular languages by automata and regular expressions
Information and Computation
Succinctness of regular expressions with interleaving, intersection and counting
Theoretical Computer Science
Learning Deterministic Regular Expressions for the Inference of Schemas from XML Data
ACM Transactions on the Web (TWEB)
The complexity of regular(-like) expressions
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Chop operations and expressions: descriptional complexity considerations
DLT'11 Proceedings of the 15th international conference on Developments in language theory
The size-cost of Boolean operations on constant height deterministic pushdown automata
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
Kleene theorems for product systems
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)
Foundations of regular expressions in XML schema languages and SPARQL
PhD '12 Proceedings of the on SIGMOD/PODS 2012 PhD Symposium
Learning twig and path queries
Proceedings of the 15th International Conference on Database Theory
The size-cost of Boolean operations on constant height deterministic pushdown automata
Theoretical Computer Science
Descriptional complexity of deterministic regular expressions
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
| Hi-index | 0.00 |
Several measures of the complexity of a regular expression are defined. (Star height and number of alphabetical symbols are two of them.) Upper and lower estimates for the complexities of expressions for certain sets of paths on graphs are derived.