Algebraic and Combinatorial Tools for State Complexity : Application to the Star-Xor Problem

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 on...

Full description

Bibliographic Details
Main Authors: Pascal Caron, Edwin Hamel-de le Court, Jean-Gabriel Luque
Format: Article
Language:English
Published: Open Publishing Association 2019-09-01
Series:Electronic Proceedings in Theoretical Computer Science
Online Access:http://arxiv.org/pdf/1909.07663v1