Directable nondeterministic automata
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...
Elmentve itt :
| Szerzők: | |
|---|---|
| Dokumentumtípus: | Cikk |
| Megjelent: |
1999
|
| Sorozat: | Acta cybernetica
14 No. 1 |
| Kulcsszavak: | Számítástechnika, Kibernetika, Automaták |
| Tárgyszavak: | |
| Online Access: | http://acta.bibl.u-szeged.hu/12613 |
| Tartalmi kivonat: | 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. |
|---|---|
| Terjedelem/Fizikai jellemzők: | 105-115 |
| ISSN: | 0324-721X |