13 citations · 28 across the 13 of their papers we have counts for
14 papers
Presentation of monoids generated by a projection and an involution
Pascal Caron, Jean-Gabriel Luque, Bruno Patrou
Monoids generated by elements of order two appear in numerous places in the literature. For example, Coxeter reflection groups in geometry, Kuratowski monoids in topology, various…
State complexity of the star of a Boolean operation
Pascal Caron, Edwin Hamel-de-le court, Jean-Gabriel Luque
Monsters and modifiers are two concepts recently developed in the state complexity theory. A monster is an automaton in which every function from states to states is represented by…
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…
New tools for state complexity
Pascal Caron, Edwin Hamel-De le court, Jean-Gabriel Luque +1
A monster is an automaton in which every function from states to states is represented by at least one letter. A modifier is a set of functions allowing one to transform a set of a…