On the Shuffle Automaton Size for Words


We investigate the state size of DFAs accepting the shuffle of two words. We provide words u and v, such that the minimal DFA for u v requires an exponential number of states. We also show some conditions for the words u and v which ensure a quadratic upper bound on the state size of u v. Moreover, switching only two letters within one of u or v is enough… (More)
DOI: 10.4204/EPTCS.3.7


4 Figures and Tables

Cite this paper

@article{Biegler2010OnTS, title={On the Shuffle Automaton Size for Words}, author={Franziska Biegler and Mark Daley and Ian McQuillan}, journal={Journal of Automata, Languages and Combinatorics}, year={2010}, volume={15}, pages={53-70} }