State complexity of catenation combined with boolean operations
Formal Languages and Automata Theory
2017-07-12 v1
Abstract
We exhaustively investigate possible combinations of a boolean operation together with a catenation. In many cases we prove and improve some conjectures by Brzozowski. For each family of operation, we endeavour to provide a common witness with a small size alphabet.
Cite
@article{arxiv.1707.03174,
title = {State complexity of catenation combined with boolean operations},
author = {Pascal Caron and Jean-Gabriel Luque and Bruno Patrou},
journal= {arXiv preprint arXiv:1707.03174},
year = {2017}
}
Comments
20 pages, 11 Figures