| Institute of Informatics>>> Acta Cybernetica>>> Past Issues>>> Volume 16, Number 1, 2003>>> |
 Magyarul
|
On directable nondeterministic trapped automata
Balázs Imreh, Csanád Imreh, and M. 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. In \cite{imstnd}, 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 D${i}$-directing words of $n$-state D$i$-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.
Full text
Available electronic editions: PDF.
Note that full text is available only for papers that are at least 3 years old. For more recent papers only the first page of the paper is provided.
BibTeX entry
@article{ImrehB:2003:ActaCybernetica,author = {Bal{\'a}zs Imreh and Csan{\'a}d Imreh and M. Ito},
title = {On directable nondeterministic trapped automata},
journal = {Acta Cybernetica},
year = {2003},
volume = {16},
number = {1},
pages = {37--45},
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. In \cite{imstnd}, 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 D${i}$-directing words of $n$-state D$i$-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.}
}