2019/09/17 by Pascal Caron, Edwin Hamel-de le Court, Jean-Gabriel Luque
Computer Science · #cs.FL
paper · pdf · doi:10.4204/eptcs.305.11
published as EPTCS 305, 2019, pp. 154-168 · In Proceedings GandALF 2019, arXiv:1909.05979
arxiv created 2019/09/17 · arxiv updated 2019/09/18
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.