2 citations · 6 across the 5 of their papers we have counts for
6 papers · 1 filter
The state complexity of a class of operations involving roots and boolean operations
Pascal Caron, Edwin Hamel-de-le-court, Jean-Gabriel Luque
Modifiers are a sets of functions acting on tuple of automata and allowing one to construct regular operations. We define and study the class of friendly modifiers that describes a…
Algebraic and Combinatorial Tools for State Complexity : Application to the Star-Xor Problem
Pascal Caron, Edwin Hamel-de le Court, Jean-Gabriel Luque
We investigate the state complexity of the star of symmetrical differences using modifiers and monsters. A monster is an automaton in which every function from states to states is…
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…
On the decidability of -Block determinism
Pascal Caron, Ludovic Mignot, Clément Miklarz
Brüggemann-Klein and Wood define a one-unambiguous regular language as a language that can be recognized by a deterministic Glushkov automaton. They give a procedure performed on t…
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…