Caron, Pascal and court, Edwin Hamel-De le and Luque, Jean-Gabriel and Patrou, Bruno - New tools for state complexity

dmtcs:4835 - Discrete Mathematics & Theoretical Computer Science, March 16, 2020, vol. 22 no. 1
New tools for state complexity

Authors: Caron, Pascal and court, Edwin Hamel-De le and Luque, Jean-Gabriel and Patrou, Bruno

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. We revisit some language transformation algorithms in terms of modifier and monster. These new theoretical concepts allow one to find easily some state complexities. We illustrate this by retrieving the state complexity of the Star of Intersection and the one of the Square root operation.


Volume: vol. 22 no. 1
Section: Automata, Logic and Semantics
Published on: March 16, 2020
Submitted on: September 18, 2018
Keywords: Computer Science - Formal Languages and Automata Theory


Share

Consultation statistics

This page has been seen 191 times.
This article's PDF has been downloaded 4 times.