Directable nondeterministic automata

Imreh Balázs and Steinby Magnus: Directable nondeterministic automata. In: Acta cybernetica, (14) 1. pp. 105-115. (1999)

[thumbnail of cybernetica_014_numb_001_105-115.pdf]
Cikk, tanulmány, mű

Download (808kB) | Preview


An automaton is directable if it has a directing word which takes it from every state to the same state. For nondeterministic (n.d.) automata directability can be defined in several meaningful ways. We consider three such notions. An input word w of an n.d. automaton A is (1) Dl-directing if the set of states aw in which A may be after reading w consists of the same single state c for all initial states a; (2) D2-directing if the set aw is independent of the initial state a; (3) D3-directing if some state c appears in all of the sets aw. We consider the sets of D1-, D2- and D3-directing words of a given n.d. automaton, and compare the classes of D1-, D2- and D3-directable n.d. automata with each other. We also estimate the lengths of the longest possible minimum-length D1-, D2- and D3-directing words of an n-state n.d. automaton. All questions are studied separately for n.d. automata which have at least one next state for every input-state pair.

Item Type: Article
Journal or Publication Title: Acta cybernetica
Date: 1999
Volume: 14
Number: 1
ISSN: 0324-721X
Page Range: pp. 105-115
Language: English
Place of Publication: Szeged
Related URLs:
Uncontrolled Keywords: Számítástechnika, Kibernetika, Automaták
Additional Information: Bibliogr.: 115. p. ; összefoglalás angol nyelven
Subjects: 01. Natural sciences
01. Natural sciences > 01.02. Computer and information sciences
Date Deposited: 2016. Oct. 15. 12:26
Last Modified: 2022. Jun. 14. 09:11

Actions (login required)

View Item View Item