2020/04/27 by Pascal Caron, Caron, Pascal, Edwin Hamel-de le Court +3 · 1 citation
Computer Science · #FOS: Computer and information sciences #Formal Languages and Automata Theory (cs.FL) #Formal Methods in Verification #Logic, programming, and type systems #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.2004.12958
openalex publication_date 2020/04/27 · openalex created_date 2020/05/13 · openalex updated_date 2026/07/28
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.