A Note on Synchronized Automata and Road Coloring Problem

Authors:
Karel Culik, II;Juhani Karhumäki;Jarkko Kari
Affiliations:
-;-;-
Venue:
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Year:
2001

Citing 3
Cited 3

An introduction to symbolic dynamics and coding

An introduction to symbolic dynamics and coding
Symbolic dynamics and finite automata

Handbook of formal languages, vol. 2
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation

Synchronization

Information and Computation
A partially synchronizing coloring

CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
An algorithm for road coloring

IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a 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.