The Cerny conjecture for automata respecting intervals of a directed graph
Abstract
The Cern\'y's conjecture states that for every synchronizing automaton with n states there exists a reset word of length not exceeding (n-11)2. We prove this conjecture for a class of automata preserving certain properties of intervals of a directed graph. Our result unifies and generalizes some earlier results obtained by other authors.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.