On monogenic nondeterministic automata

Authors:
Csanád Imreh;Masami Ito
Affiliations:
Department of Informatics, University of Szeged, Szeged, Hungary;Dept. of Mathematics, Faculty of Science, Kyoto Sangyo University, Kyoto, Japan
Venue:
Acta Cybernetica
Year:
2008

Citing 6
Cited 1

On synchronizing unambiguous automata

Theoretical Computer Science
Directable nondeterministic automata

Acta Cybernetica
On directable nondeterministic trapped automata

Acta Cybernetica
On monotonic directable nondeterministic automata

Journal of Automata, Languages and Combinatorics
Algebraic Theory of Automata & Languages

Algebraic Theory of Automata & Languages
Synchronizing generalized monotonic automata

Theoretical Computer Science - Insightful theory

Improved upper bounds on synchronizing nondeterministic automata

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

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, three such notions, D1-, D2-, and D3-directability, are used. In this paper, we consider monogenic n.d. automata, and for each i = 1,2,3, we present sharp bounds for the maximal lengths of the shortest Di-directing words.