Succinctness of Regular Expressions with Interleaving, Intersection and Counting
- 18 August 2008
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
- Vol. 411, 363-374
- https://doi.org/10.1007/978-3-540-85238-4_29
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- Finite Automata, Digraph Connectivity, and Regular Expression SizeLecture Notes in Computer Science, 2008
- Learning deterministic regular expressions for the inference of schemas from XML dataPublished by Association for Computing Machinery (ACM) ,2008
- Optimal Lower Bounds on Regular Expression Size Using Communication ComplexityPublished by Springer Science and Business Media LLC ,2008
- Optimizing Schema Languages for XML: Numerical Constraints and InterleavingLecture Notes in Computer Science, 2006
- Regular expressions into finite automataTheoretical Computer Science, 1993
- A tale of two grepsSoftware: Practice and Experience, 1988
- The complexity of the inequivalence problem for regular expressions with intersectionLecture Notes in Computer Science, 1980
- Complexity measures for regular expressionsJournal of Computer and System Sciences, 1976
- Rank-non-increasing transformations on transition graphsInformation and Control, 1972
- Transition graphs and the star-height of regular events.The Michigan Mathematical Journal, 1963