State complexity of catenation combined with a boolean operation: a unified approach
In this paper we study the state complexity of catenation combined with symmetric difference. First, an upper bound is computed using some combinatoric tools. Then, this bound is shown to be tight by giving a witness for it. Moreover, we relate this work with the study of state complexity for two other combinations: catenation with union and catenation with intersection. And we extract a unified approach which allows to obtain the state complexity of any combination involving catenation and a binary boolean operation.
PDF AbstractCategories
Formal Languages and Automata Theory
Combinatorics
Datasets
Add Datasets
introduced or used in this paper
