State Complexity of Catenation Combined with a Boolean Operation: A Unified Approach
Pascal Caron, Jean-Gabriel Luque, Ludovic Mignot, Bruno Patrou · International Journal of Foundations of Computer Science · 2016
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. We extract a unified approach which allows to obtain the state complexity of any combination involving catenation and a binary boolean operation.