A NOTE ON SYNCHRONIZED AUTOMATA AND ROAD COLORING PROBLEM-Reference-Cited by-同舟云学术

A NOTE ON SYNCHRONIZED AUTOMATA AND ROAD COLORING PROBLEM

Published:2002-06 Issue:03 Volume:13 Page:459-471
ISSN:0129-0541
Container-title:International Journal of Foundations of Computer Science
language:en
Short-container-title:Int. J. Found. Comput. Sci.

Author:

CULIK KAREL¹,KARHUMÄKI JUHANI²,KARI JARKKO³

Affiliation:

1. Department of Computer Science, University of South Carolina, Columbia, South Carolina 29208, USA

2. Department of Mathematics and Turku Centre for Computer Science, University of Turku, FIN-20014 Turku, Finland

3. Department of Computer Science, 14 MacLean Hall, University of Iowa, Iowa City, Iowa 52242, USA

Abstract

We consider the problem of labeling a directed multigraph so that it becomes a synchronized finite automaton, as an ultimate goal to solve the famous Road Coloring Conjecture, cf. [1,2]. We introduce a relabeling method which can be used for a large class of automata to improve their 'degree of synchronization'. This allows, for example, to formulate the conjecture in several equivalent ways.

Publisher

World Scientific Pub Co Pte Lt

Subject

Computer Science (miscellaneous)

Link

https://www.worldscientific.com/doi/pdf/10.1142/S0129054102001217

Reference9 articles.

1. Equivalence of topological Markov shifts

2. Synchronizing Finite Automata on Eulerian Digraphs

Cited by 34 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Synchronization of Primitive Automata;RAIRO - Theoretical Informatics and Applications;2024

2. New characterizations of primitive permutation groups with applications to synchronizing automata;Information and Computation;2023-12

3. The road problem and homomorphisms of directed graphs;Theoretical Computer Science;2023-08

4. Primitivity and Hurwitz Primitivity of Nonnegative Matrix Tuples: A Unified Approach;SIAM Journal on Matrix Analysis and Applications;2023-03-10

5. Index;An Introduction to Symbolic Dynamics and Coding;2021-01-21