2 citations · 4 across the 3 of their papers we have counts for
3 papers
A combinatorial approach for the state complexity of the Shuffle product
Pascal Caron, Jean-Gabriel Luque, Bruno Patrou
We investigate the state complexity of the shuffle operation on regular languages initiated by Campeanu et al. and studied subsequently by Brzozowski et al. We shift the problem in…
State complexity of catenation combined with boolean operations
Pascal Caron, Jean-Gabriel Luque, Bruno Patrou
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 fam…
State complexity of catenation combined with a boolean operation: a unified approach
Pascal Caron, Jean-Gabriel Luque, Ludovic Mignot +1
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 s…