The state complexity of a class of operations involving roots and boolean operations
Formal Languages and Automata Theory
2020-04-28 v1
Abstract
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.
Cite
@article{arxiv.2004.12958,
title = {The state complexity of a class of operations involving roots and boolean operations},
author = {Pascal Caron and Edwin Hamel-de-le-court and Jean-Gabriel Luque},
journal= {arXiv preprint arXiv:2004.12958},
year = {2020}
}
Comments
17 pages