Some remarks on directable automata
A finite automaton is said to be directable if there exists a word, a directing word, which takes the automaton from every state to the same state. After some general remarks on directable automata and their directing words we present methods for testing the directability of an automaton and for fin...
Elmentve itt :
| Szerzők: | |
|---|---|
| Dokumentumtípus: | Cikk |
| Megjelent: |
1995
|
| Sorozat: | Acta cybernetica
12 No. 1 |
| Kulcsszavak: | Számítástechnika, Kibernetika, Automaták |
| Tárgyszavak: | |
| Online Access: | http://acta.bibl.u-szeged.hu/29454 |