2 papers
cs.FL2017
Synchronizing automata and the language of minimal reset words
Emanuele Rodaro
We study a connection between synchronizing automata and its set of minimal reset words, i.e., such that no proper factor is a reset word. We first show that any synchronizing…
cs.FL2014
Representation of (Left) Ideal Regular Languages by Synchronizing Automata
Marina Maslennikova, Emanuele Rodaro
We follow language theoretic approach to synchronizing automata and Černý's conjecture initiated in a series of recent papers. We find a precise lower bound for the reset complexit…