Skip to main content
SpringerLink
Log in

A Note on Synchronized Automata and Road Coloring Problem

  • Conference paper
  • First Online:
Developments in Language Theory (DLT 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2295))

Included in the following conference series:

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.

Supported by the Academy of Finland under grant 44087 and by NSF under grant CCR 97-33101.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. L. Adler, L.W. Goodwyn and B. Weiss, Equivalence of Topological Markov Shifts, Israel J. Math. 27, 49–63, (1977).

    Article  MATH  MathSciNet  Google Scholar 

  2. M.-P. Beal and D. Perrin, Symbolic Dynamics and Finite automata, in: G. Rozenberg and A. Salomaa (eds.) Handbook of Formal Languages Vol II, 49–63, (1997).

    Google Scholar 

  3. J. Černí, Poznámka k homogennym experimenton s konečnými automatmi, Mat. fyz. čas. SAV 14, 208–215, (1964).

    Google Scholar 

  4. J. Friedman On the road coloring problem, Math. Soc. 110, 1133–1135, (1990).

    MATH  Google Scholar 

  5. J. E. Hopcroft and J. D. Ullman, Introduction to Automata Theory, Languages and Computation, (Addison-Wesley 1979).

    Google Scholar 

  6. A. Kljachko, I. Rystsow and K. Spivak, Extended combinatorial problem concerning the length of the reset word in a finite automaton, Cybernetics 23, 165–170, (1987).

    Article  Google Scholar 

  7. J. Kari, A counter example to a conjecture concerning synchronized words in finite automata, EATCS Bull. 73, 146, (2001).

    MATH  MathSciNet  Google Scholar 

  8. D. Lind and B. Marcus, An Introduction of Symbolic Dynamics and Coding, (Cambridge Univ. Press, 1995).

    Google Scholar 

  9. G. L. O’ Brien, The road coloring problem, Israel J. Math. 39, 145–154, (1981).

    Article  MATH  MathSciNet  Google Scholar 

  10. D. Perrin and M.P. Schüzenberger, Synchronizing prefix codes and automata and the road coloring problem, in: P. Walters (ed.) Symbolic Dynamics and its Applications, Contemporary Mathematics 135, 295–318, (1991).

    Google Scholar 

  11. J.-E. Pin, Le probleme de la conjecture de Černý, These de 3e cycle, Universite de Paris VI (1978).

    Google Scholar 

  12. J.-E. Pin, On two combinatorial problems arising from automata theory, Annals of Discrete Mathematics 17, 535–548, (1983).

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Karel Culik II

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

    Juhani Karhumäki

  3. Department of Computer Science, 14 MLH University of Iowa, 52242, Iowa City, IA, USA

    Jarkko Kari

Authors
  1. Karel Culik II
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Juhani Karhumäki
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jarkko Kari
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Algebra und Computermathematik Abt. für Theoretische Informatik, Technische Universität Wien, Wiedner Hauptstraße 8-10, 1040, Wien, Austria

    Werner Kuich

  2. Department of Computer Science, Leiden University, P.O. Box 9512, 2300, RA Leiden, The Netherlands

    Grzegorz Rozenberg

  3. Turku Centre for Computer Science, Lemminkaisenkatu 14A, 20520, Turku, Finland

    Arto Salomaa

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Culik, K., Karhumäki, J., Kari, J. (2002). A Note on Synchronized Automata and Road Coloring Problem. In: Kuich, W., Rozenberg, G., Salomaa, A. (eds) Developments in Language Theory. DLT 2001. Lecture Notes in Computer Science, vol 2295. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46011-X_14

Download citation

  • DOI: https://doi.org/10.1007/3-540-46011-X_14

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43453-5

  • Online ISBN: 978-3-540-46011-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation