On synchronizing unambiguous automata
Theoretical Computer Science
Reset sequences for monotonic automata
SIAM Journal on Computing
Directable nondeterministic automata
Acta Cybernetica
Decompositions of automata and transition semigroups
Acta Cybernetica
Sur un Cas Particulier de la Conjecture de Cerny
Proceedings of the Fifth Colloquium on Automata, Languages and Programming
On monotonic directable nondeterministic automata
Journal of Automata, Languages and Combinatorics
On monogenic nondeterministic automata
Acta Cybernetica
Improved upper bounds on synchronizing nondeterministic automata
Information Processing Letters
Preset and adaptive homing experiments for nondeterministic finite state machines
CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
Synchronization of automata with one undefined or ambiguous transition
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
| Hi-index | 0.00 |
A finite automaton is said to be directable if it has an input word, a directing word, which takes it from every state into the same state. For nondeterministic (n.d.) automata, directability can be generalized in several ways. In [8], three such notions, D1-, D2-, and D3-directability, are introduced. In this paper, we introduce the trapped n.d. automata, and for each i = 1, 2, 3, present lower and upper bounds for the lengths of the shortest Di-directing words of n-state Di-directable trapped n.d. automata. It turns out that for this special class of n.d. automata, better bounds can be found than for the general case, and some of the obtained bounds are sharp.