Georg Bachmeier

Learn More
We answer two open questions by (Gruber, Holzer, Kutrib, 2009) on the state-complexity of representing sub-or superword closures of context-free grammars (CFGs): (1) We prove a (tight) upper bound of 2 O(n) on the size of nondeterministic finite automata (NFAs) representing the subword closure of a CFG of size n. (2) We present a family of CFGs for which(More)
  • 1