Synchronizing Finite Automata on Eulerian Digraphs
نویسنده
چکیده
1 Cern2 y’s conjecture and the road coloring problem are two open problems concerning synchronization of !nite automata. We prove these conjectures in the special case that the vertices have uniform inand outdegrees. c © 2002 Elsevier Science B.V. All rights reserved.
منابع مشابه
Synchronizing Automata on Quasi-Eulerian Digraph
In 1964 Černý conjectured that each n-state synchronizing automaton posesses a reset word of length at most (n − 1). From the other side the best known upper bound on the reset length (minimum length of reset words) is cubic in n. Thus the main problem here is to prove quadratic (in n) upper bounds. Since 1964, this problem has been solved for few special classes of synchronizing automata. One ...
متن کاملČerný conjecture for edge-colored digraphs with few junctions
In this paper we consider the Cerny 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 Cerny conjecture. We argue that this yields not only a new class of automata for which the Cerny conj...
متن کاملFinite automata for testing uniqueness of Eulerian trails
We investigate the condition under which the Eulerian trail of a digraph is unique, and design a finite automaton to examine it. The algorithm is effective, for if the condition is violated, it will be noticed immediately without the need to trace through the whole trail.
متن کاملPrimitive digraphs with large exponents and slowly synchronizing automata
We present several infinite series of synchronizing automata for which the minimum length of reset words is close to the square of the number of states. All these automata are tightly related to primitive digraphs with large exponent. 1 Background and the structure of the paper This paper has arisen from our attempts to find a theoretical explanation for the results of certain computational exp...
متن کاملSynchronizing automata and principal eigenvectors of the underlying digraphs
A coloring of a digraph with a fixed out-degree k is a distribution of k labels over the edges resulting in a deterministic finite automaton. An automaton is called synchronizing if there exists a word which sends all states of the automaton to a single state. In the present paper we study connections between spectral and synchronizing properties of digraphs. We show that if a coloring of a dig...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 295 شماره
صفحات -
تاریخ انتشار 2001