Representation of (Left) Ideal Regular Languages by Synchronizing Automata
Formal Languages and Automata Theory
2014-12-23 v1
Abstract
We follow language theoretic approach to synchronizing automata and \v{C}ern\'{y}'s conjecture initiated in a series of recent papers. We find a precise lower bound for the reset complexity of a principal ideal languages. Also we show a strict connection between principal left ideals and synchronizing automata. We characterize regular languages whose minimal deterministic finite automaton is synchronizing and possesses a reset word belonging to the recognized language.
Keywords
Cite
@article{arxiv.1412.6767,
title = {Representation of (Left) Ideal Regular Languages by Synchronizing Automata},
author = {Marina Maslennikova and Emanuele Rodaro},
journal= {arXiv preprint arXiv:1412.6767},
year = {2014}
}