State complexity of catenation combined with boolean operations
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.
- Publication:
-
arXiv e-prints
- Pub Date:
- July 2017
- DOI:
- arXiv:
- arXiv:1707.03174
- Bibcode:
- 2017arXiv170703174C
- Keywords:
-
- Computer Science - Formal Languages and Automata Theory
- E-Print:
- 20 pages, 11 Figures