Algebraic and Combinatorial Tools for State Complexity : Application to the Star-Xor Problem
Formal Languages and Automata Theory
2019-09-18 v1
Abstract
We investigate the state complexity of the star of symmetrical differences using modifiers and monsters. A monster is an automaton in which every function from states to states is represented by at least one letter. A modifier is a set of functions allowing one to transform a set of automata into one automaton. These recent theoretical concepts allow one to find easily the desired state complexity. We then exhibit a witness with a constant size alphabet.
Cite
@article{arxiv.1909.07663,
title = {Algebraic and Combinatorial Tools for State Complexity : Application to the Star-Xor Problem},
author = {Pascal Caron and Edwin Hamel-de le Court and Jean-Gabriel Luque},
journal= {arXiv preprint arXiv:1909.07663},
year = {2019}
}
Comments
In Proceedings GandALF 2019, arXiv:1909.05979