State complexity of catenation combined with boolean operations
classification
💻 cs.FL
keywords
booleancatenationoperationalphabetbrzozowskicasescombinationscombined
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.