Černý conjecture for edge-colored digraphs with few junctions
References (10)
- et al.
Synchronizing monotonic automata
Theor. Comput. Sci.
(2004) - et al.
Synchronizing generalized monotonic automata
Theor. Comput. Sci.
(2005) Synchronizing finite automata on Eulerian digraphs
Theor. Comput. Sci.
(2003)Synchronizing automata preserving a chain of partial orders
Theor. Comput. Sci.
(2009)Poznámka k. homogénnym experimentom s konecnými automatmi
Mat. fyz. čas SAV
(1964)
There are more references available in the full text version of this article.
Cited by (2)
Preimage problems for deterministic finite automata
2021, Journal of Computer and System SciencesCitation Excerpt :They also reveal interesting connections with many parts of mathematics. For example, some of the recent works involve group theory [7], representation theory [8], computational complexity [9], optimization and convex geometry [10], regular languages and universality [11], approximability [12], primitive sets of matrices [13], and graph theory [14]. For a brief introduction to the theory of synchronizing automata we refer the reader to an excellent, though quite outdated, survey [15].
Synchronizing sequences for road colored digraphs
2020, Discrete Applied MathematicsCitation Excerpt :It requires some small introduction. The main result of this paper (announced in [9]) is the following. All 2-junction automata satisfy the Černý conjecture.
- 1
Supported in part by Polish NCN grant 2012/07/B/ST1/03318.
Published by Elsevier B.V.