New tools for state complexity

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

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Discrete mathematics and theoretical computer science 2020-03, Vol.22 no. 1 (Automata, Logic and Semantics)
Hauptverfasser:	Caron, Pascal, Court, Edwin Hamel-de Le, Luque, Jean-Gabriel, Patrou, Bruno
Format:	Artikel
Sprache:	eng
Schlagworte:	Computer Science computer science - formal languages and automata theory
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	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.
ISSN:	1365-8050
DOI:	10.23638/DMTCS-22-1-9