Institute of Informatics
Acta Cybernetica
Past Issues
Volume 18, Number 4, 2008
On Monogenic Nondeterministic Automata
# On Monogenic Nondeterministic Automata

**Csanád Imreh and Masami Ito**

### Abstract (in LaTeX format)

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 D$i$-directing words.

### Full text

Available electronic editions: PDF.

### DOI

DOI is not available for this article.

### BibTeX entry
`
@ARTICLE{Imreh:2008:ActaCybernetica,`

author = {Csan{\'a}d Imreh and Masami Ito},

title = {On Monogenic Nondeterministic Automata},

journal = {Acta Cybernetica},

year = {2008},

volume = {18},

pages = {777--782},

number = {4},

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 D$i$-directing words.}

}