Finite Automata, Digraph Connectivity, and Regular Expression Size

@inproceedings{Gruber2008FiniteAD,
  title={Finite Automata, Digraph Connectivity, and Regular Expression Size},
  author={Hermann Gruber and Markus Holzer},
  booktitle={ICALP},
  year={2008}
}
We study some descriptional complexity aspects of regular expressions. In particular, we give lower bounds on the minimum required size for the conversion of deterministic finite automata into regular expressions and on the required size of regular expressions resulting from applying some basic language operations on them, namely intersection, shuffle, and complement. Some of the lower bounds obtained are asymptotically tight, and, notably, the examples we present are over an alphabet of size… CONTINUE READING