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...
Saved in:
| Main Authors: | |
|---|---|
| Format: | Article |
| Published: |
1995
|
| Series: | Acta cybernetica
12 No. 1 |
| Kulcsszavak: | Számítástechnika, Kibernetika, Automaták |
| Subjects: | |
| Online Access: | http://acta.bibl.u-szeged.hu/29454 |
| Summary: | 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 finding the least congruence of an automaton which yields a directable quotient automaton. A well-known conjecture by J. Cera? claims that any n-state directable automaton has a directing word of length <(n-x)5, but the best known upper bounds are of the order 0(re*). However, for special classes of automata lower bounds can be given. We consider a generalized form of Cern?'s conjecture proposed by J.-E. Pin for the classes of commutative, definite, reverse definite, generalized definite and nilpotent automata. We also establish the inclusion relationships between these classes within the class of directable automata. |
|---|---|
| Physical Description: | 23-35 |
| ISSN: | 0324-721X |