We investigate the complexity of some synchronizability problems for automata that are both monotonic and partially specified. We show that checking the ...
We investigate the complexity of some synchroniz- ability problems for automata that are both monotonic and partially specified. We show that checking the ...
This study introduces several problems related to finding reset words for deterministic finite automata, and presents motivations for these problems for ...
We investigate the complexity of some synchronizability problems for automata that are both monotonic and partially specified. We show that checking the ...
Abstract: In this study, we first introduce several problems related to finding reset words for deterministic finite automata, and present motivations for ...
Synchronization problems in automata without non-trivial cycles
www.sciencedirect.com › article › pii
Oct 1, 2019 · We study the computational complexity of various problems related to synchronization of weakly acyclic automata, a subclass of widely studied ...
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 show that the problem of checking careful synchronizability of partial finite automata is PSPACE-complete. Also the problems of checking D 1-, D 2-, ...
Abstract. We study the computational complexity of various problems related to synchronization of weakly acyclic automata, a subclass of.
Yenigün, Complexities of some problems related to synchronizing, non-synchronizing and monotonic automata. Int. J. Found. Comput. Sci. 26 (2015) 99–122 ...