Černý conjecture for edge-colored digraphs with few junctions

https://doi.org/10.1016/j.endm.2016.09.021Get rights and content

Abstract

In this paper we consider the Černý conjecture in terminology of colored digraphs corresponding to finite automata. We define a class of colored digraphs having a relatively small number of junctions between paths determined by different colors, and prove that digraphs in this class satisfy the Černý conjecture. We argue that this yields not only a new class of automata for which the Černý conjecture is verified, but also that our approach may be viewed as a new more systematic way to attack the Černý conjecture in its generality, giving an insight into the complexity of the problem.

References (10)

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 Sciences
    Citation 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 Mathematics
    Citation 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.

View full text