State complexity of multiple catenation
Formal Languages and Automata Theory
2016-07-15 v1
Abstract
We improve some results relative to the state complexity of the multiple catenation described by Gao and Yu. In particular we nearly divide by 2 the size of the alphabet needed for witnesses. We also give some refinements to the algebraic expression of the state complexity, which is especially complex with this operation. We obtain these results by using peculiar DFAs defined by Brzozowski.
Cite
@article{arxiv.1607.04031,
title = {State complexity of multiple catenation},
author = {Pascal Caron and Jean-Gabriel Luque and Bruno Patrou},
journal= {arXiv preprint arXiv:1607.04031},
year = {2016}
}