Some remarks on directable automata

Imreh Balázs and Steinby Magnus: Some remarks on directable automata. In: Acta cybernetica, (12) 1. pp. 23-35. (1995)

[thumbnail of cybernetica_012_numb_001_023-035.pdf]
Cikk, tanulmány, mű

Download (729kB) | Preview


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.

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

Actions (login required)

View Item View Item