most citedThe state complexity of a class of operations involving roots and boolean operations

2 citations · 2 across the 1 of their papers we have counts for

collaborators

1 paper

cs.FL2020★ 2 cited

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…