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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callSimilar Papers
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
