We prove PSPACE-completeness of checking whether a given ideal language serves as the language of reset words for some automaton with at most four states over a binary alphabet. © IFIP International Federation for Information Processing 2017
We introduce the notion of reset left regular decomposition of an ideal regular language and we prov...
We approach the problem of finding strongly connected synchronizing automata with a given ideal I th...
We follow language theoretic approach to synchronizing automata and Cerny's conjecture initiated in ...
A deterministic finite automaton A is said to be synchronizing if it has a reset word, i.e. a word t...
We follow language theoretic approach to synchronizing automata and Černý’s conjecture initiated in ...
We study representations of ideal languages by means of strongly connected synchronizing automata. F...
We introduce the notion of a reset left regular decomposition of an ideal regular language, and we p...
We study ideal languages generated by a single word. We provide an algorithm to construct a strongly...
A deterministic finite-state automaton A is said to be synchronizing if there is a synchronizing wor...
We refine a uniform algebraic approach for deriving upper bounds on reset thresholds of synchronizin...
Many variations of synchronization of finite automata have been studied in the previous decades. Her...
We introduce the notion of reset left regular decomposition of an ideal regular language and we prov...
We approach the problem of finding strongly connected synchronizing automata with a given ideal I th...
We follow language theoretic approach to synchronizing automata and Cerny's conjecture initiated in ...
A deterministic finite automaton A is said to be synchronizing if it has a reset word, i.e. a word t...
We follow language theoretic approach to synchronizing automata and Černý’s conjecture initiated in ...
We study representations of ideal languages by means of strongly connected synchronizing automata. F...
We introduce the notion of a reset left regular decomposition of an ideal regular language, and we p...
We study ideal languages generated by a single word. We provide an algorithm to construct a strongly...
A deterministic finite-state automaton A is said to be synchronizing if there is a synchronizing wor...
We refine a uniform algebraic approach for deriving upper bounds on reset thresholds of synchronizin...
Many variations of synchronization of finite automata have been studied in the previous decades. Her...
We introduce the notion of reset left regular decomposition of an ideal regular language and we prov...
We approach the problem of finding strongly connected synchronizing automata with a given ideal I th...
We follow language theoretic approach to synchronizing automata and Cerny's conjecture initiated in ...
DOI
Add to ORKG