论文标题
一类涉及根和布尔操作的操作类别的国家复杂性
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.
