24 citations · 24 across the 3 of their papers we have counts for
3 papers
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…
cs.FL2014
Complexity of checking whether two automata are synchronized by the same language
Marina Maslennikova
A deterministic finite automaton is said to be synchronizing if it has a reset word, i.e. a word that brings all states of the automaton to a particular one. We prove that it is a…
cs.FL2014★ 24 cited
Reset Complexity of Ideal Languages
Marina Maslennikova
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 languag…