State complexity of catenation combined with a boolean operation: a unified approach

13 May 2015 Caron Pascal Luque Jean-Gabriel Mignot Ludovic Patrou Bruno

In this paper we study the state complexity of catenation combined with symmetric difference. First, an upper bound is computed using some combinatoric tools... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • FORMAL LANGUAGES AND AUTOMATA THEORY
  • COMBINATORICS