We follow language theoretic approach to synchronizing automata and Cerny's conjecture initiated in a series of recent papers. We prove that for every ideal language there exists a strongly connected synchronizing automaton from some special class for which given language serves as the language of reset words. This class is formed by trim automata recognizing left quotients of principal left ideal languages. We show that the minimal automaton recognizing a left quotient of a principal left ideal can be viewed as a synchronizing automaton for which given finitely generated ideal serves as the language of reset words.
|Titolo:||Trim strongly connected synchronizing automata and ideal languages|
|Data di pubblicazione:||2018|
|Appare nelle tipologie:||01.1 Articolo in Rivista|