Skip to main content
SpringerLink
Log in

Recognizing Synchronizing Automata with Finitely Many Minimal Synchronizing Words is PSPACE-Complete

  • Conference paper
Models of Computation in Context (CiE 2011)

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

Included in the following conference series:

Abstract

A deterministic finite-state automaton \(\mathcal{A}\) is said to be synchronizing if there is a synchronizing word, i.e. a word that takes all the states of the automaton \(\mathcal{A}\) to a particular one. We consider synchronizing automata whose language of synchronizing words is finitely generated as a two-sided ideal in Σ*. Answering a question stated in [1], here we prove that recognizing such automata is a PSPACE-complete problem.

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.

Similar content being viewed by others

References

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

    Article  MathSciNet  MATH  Google Scholar 

  2. Černý, J.: Poznámka k homogénnym eksperimentom s konečnými automatami [in slovak]. Mat.-Fyz. Čas. Slovensk. Akad. Vied. 14, 208–216 (1964)

    Google Scholar 

  3. Mateescu, A., Salomaa, A.: Many-valued truth functions, Černý’s conjecture and road coloring. EATCS Bull 68, 134–150 (1999)

    MATH  Google Scholar 

  4. 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 

  5. 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 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Ural State University, 620083, Ekaterinburg, Russia

    Elena V. Pribavkina

  2. Centro de Matematica, Faculdade de Ciências, Universidade do Porto, 4169-007, Porto, Portugal

    Emanuele Rodaro

Authors
  1. Elena V. Pribavkina
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Emanuele Rodaro
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute for Logic, Language and Computation, University of Amsterdam, 1090, Amsterdam, GE, The Netherlands

    Benedikt Löwe

  2. Department of Mathematics, University of Oslo, 0316, Oslo, Norway

    Dag Normann

  3. Department of Mathematical Logic and Applications, Sofia University, 1164, Sofia, Bulgaria

    Ivan Soskov  & Alexandra Soskova  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pribavkina, E.V., Rodaro, E. (2011). Recognizing Synchronizing Automata with Finitely Many Minimal Synchronizing Words is PSPACE-Complete. In: Löwe, B., Normann, D., Soskov, I., Soskova, A. (eds) Models of Computation in Context. CiE 2011. Lecture Notes in Computer Science, vol 6735. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21875-0_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-21875-0_24

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-21874-3

  • Online ISBN: 978-3-642-21875-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation