The state complexity of a class of operations involving roots and boolean operations
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 class of regular operations involving compositions of boolean operations and roots. We also give an explicit tight bound for the state complexity of these operations.
cs.FL↗