Skip to main content
SpringerLink
Log in

Complexity of Road Coloring with Prescribed Reset Words

  • Conference paper
  • First Online:
Language and Automata Theory and Applications (LATA 2015)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8977))

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. Adler, R., Goodwyn, L., Weiss, B.: Equivalence of topological Markov shifts. Israel Journal of Mathematics 27(1), 49–63 (1977)

    Article  MATH  MathSciNet  Google Scholar 

  2. Roman, A., Drewienkowski, M.: A complete solution to the complexity of synchronizing road coloring for non-binary alphabets (2014)

    Google Scholar 

  3. Roman, A.: P–NP Threshold for Synchronizing Road Coloring. In: Dediu, A.-H., Martín-Vide, C. (eds.) LATA 2012. LNCS, vol. 7183, pp. 480–489. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  4. Schaefer, T.J.: The complexity of satisfiability problems. In: Proceedings of the Tenth Annual ACM Symposium on Theory of Computing, STOC 1978, pp. 216–226. ACM, New York (1978)

    Google Scholar 

  5. Trahtman, A.N.: The road coloring and Černy conjecture. In: Stringology. pp. 1–12 (2008)

    Google Scholar 

  6. Vorel, V., Roman, A.: Parameterized complexity of synchronization and road coloring (2014)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Mathematics and Physics, Charles University, Malostranské nám. 25, Prague, Czech Republic

    Vojtěch Vorel

  2. Institute of Computer Science, Jagiellonian University, Lojasiewicza 6, 30-348, Krakow, Poland

    Adam Roman

Authors
  1. Vojtěch Vorel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Adam Roman
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Vojtěch Vorel .

Editor information

Editors and Affiliations

  1. Rovira i Virgili University, Tarragona, Spain

    Adrian-Horia Dediu

  2. Nice Sophia Antipolis University, Sophia Antipolis, France

    Enrico Formenti

  3. Mathematical Linguistics, Rovira i Virgili University, Tarragona, Spain

    Carlos Martín-Vide

  4. Justus-Liebig-Universität, Gießen, Germany

    Bianca Truthe

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Vorel, V., Roman, A. (2015). Complexity of Road Coloring with Prescribed Reset Words. In: Dediu, AH., Formenti, E., Martín-Vide, C., Truthe, B. (eds) Language and Automata Theory and Applications. LATA 2015. Lecture Notes in Computer Science(), vol 8977. Springer, Cham. https://doi.org/10.1007/978-3-319-15579-1_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-15579-1_12

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-15578-4

  • Online ISBN: 978-3-319-15579-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation