We present a new characteristic of a regular ideal language called reset complexity. We find some bounds on the reset complexity in terms of the state complexity of a given language. We also compareâ€¦ (More)

We study ideal languages generated by a single word. We provide an algorithm to construct a strongly connected synchronizing automaton for which such a language serves as the language ofâ€¦ (More)

We study representations of ideal languages by means of strongly connected synchronizing automata. For every finitely generated ideal language L we construct such an automaton with at most 2 states,â€¦ (More)

A deterministic finite automaton A is said to be synchronizing if it has a reset word, i.e. a word that brings all states of the automaton A to a particular one. We prove that it is a PSPACEcompleteâ€¦ (More)

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 complexity of a principalâ€¦ (More)