Skip to main content
SpringerLink
Log in

Complexity of Checking Whether Two Automata Are Synchronized by the Same Language

  • Conference paper
Descriptional Complexity of Formal Systems (DCFS 2014)

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

Included in the following conference series:

Abstract

A deterministic finite automaton is said to be synchronizing if it has a reset word, i.e. a word that brings all states of the automaton to a particular one. We prove that it is a PSPACE-complete problem to check whether the language of reset words for a given automaton coincides with the language of reset words for some particular automaton.

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. Ananichev, D.S., Gusev, V.V., Volkov, M.V.: Slowly Synchronizing Automata and Digraphs. In: Hliněný, P., Kučera, A. (eds.) MFCS 2010. LNCS, vol. 6281, pp. 55–65. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  2. Cerný, J.: Poznámka k homogénnym eksperimentom s konečnými automatami. Mat.-Fyz. Cas. Slovensk. Akad. Vied 14, 208–216 (1964)

    MATH  Google Scholar 

  3. Eppstein, D.: Reset sequences for monotonic automata. SIAM J. Comput. 19, 500–510 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  4. Gusev, V.V., Maslennikova, M.I., Pribavkina, E.V.: Finitely generated ideal languages and synchronizing automata. In: Karhumäki, J., Lepistö, A., Zamboni, L. (eds.) WORDS 2013. LNCS, vol. 8079, pp. 143–153. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  5. Kozen, D.: Lower bounds for natural proof systems. In: Proc. of the 18th FOCS, pp. 254–266 (1977)

    Google Scholar 

  6. Martygin, P.: Computational Complexity of Certain Problems Related to Carefuuly Synchronizing Words for Partial Automata and Directing Words for Nondeterministic Automata. Theory Comput. Sci. 54, 293–304 (2014)

    Google Scholar 

  7. Maslennikova, M.I.: Reset Complexity of Ideal Languages. In: Bieliková, M. (ed.) Int. Conf. SOFSEM 2012, Proc. V. II, arXiv: 1404.2816, pp. 33–44. Institute of Computer Science Academy of Sciences of the Czech Republic (2014)

    Google Scholar 

  8. Pin, J.-E.: On two combinatorial problems arising from automata theory. Ann. Discrete Math. 17, 535–548 (1983)

    MATH  Google Scholar 

  9. Pribavkina, E.V., Rodaro, E.: Recognizing synchronizing automata with finitely many minimal synchronizing words is PSPACE-complete. In: Löwe, B., Normann, D., Soskov, I., Soskova, A. (eds.) CiE 2011. LNCS, vol. 6735, pp. 230–238. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  10. Pribavkina, E., Rodaro, E.: Synchronizing automata with finitely many minimal synchronizing words. Inf. and Comput. 209(3), 568–579 (2011)

    Article  MATH  MathSciNet  Google Scholar 

  11. Sandberg, S.: Homing and synchronizing sequences. In: Broy, M., Jonsson, B., Katoen, J.-P., Leucker, M., Pretschner, A. (eds.) Model-Based Testing of Reactive Systems. LNCS, vol. 3472, pp. 5–33. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  12. Savitch, W.J.: Relationships between nondeterministic and deterministic tape classes. J.CSS 4, 177–192 (1970)

    MATH  MathSciNet  Google Scholar 

  13. Volkov, M.V.: Synchronizing automata and the Černý conjecture. In: Martín-Vide, C., Otto, F., Fernau, H. (eds.) LATA 2008. LNCS, vol. 5196, pp. 11–27. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Ural Federal University, Ekaterinburg, Russia

    Marina Maslennikova

Authors
  1. Marina Maslennikova
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, The University of Western Ontario, N6A 5B7, London, Ontario, Canada

    Helmut Jürgensen

  2. Department of Mathematics and TUCS, University of Turku, 20014, Turku, Finland

    Juhani Karhumäki

  3. University of Turku, Fi-20014, Turku, Finland

    Alexander Okhotin

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Maslennikova, M. (2014). Complexity of Checking Whether Two Automata Are Synchronized by the Same Language. In: Jürgensen, H., Karhumäki, J., Okhotin, A. (eds) Descriptional Complexity of Formal Systems. DCFS 2014. Lecture Notes in Computer Science, vol 8614. Springer, Cham. https://doi.org/10.1007/978-3-319-09704-6_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-09704-6_27

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-09703-9

  • Online ISBN: 978-3-319-09704-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation