Complexity of Problems Concerning Carefully Synchronizing Words for PFA and Directing Words for NFA | SpringerLink
Skip to main content
Springer Nature Link
Log in

Complexity of Problems Concerning Carefully Synchronizing Words for PFA and Directing Words for NFA

  • Conference paper
Computer Science – Theory and Applications (CSR 2010)

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

Included in the following conference series:

Abstract

We show that the problem of checking careful synchronizability of partial finite automata and the problem of finding the shortest carefully synchronizing word are PSPACE-complete. We show that the problem of checking D 1, D 2 and D 3-directability of nondeterministic finite automata and the problem of finding the shortest D 1, D 2 and D 3-directing word are PSPACE-complete. The restrictions of these problems to 2-letter automata remain PSPACE-complete.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
JPY 3498
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
JPY 5719
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
JPY 7149
Price includes VAT (Japan)
  • 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. Černý, J.: Poznámka k homogénnym eksperimentom s konecnými avtomatami. Mat.-Fyz. Cas. Slovensk. Akad. Vied. 14, 208–216 (1964) (in Slovak)

    MATH  Google Scholar 

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

    MATH  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

  5. Ito, M.: Algebraic Theory of Automata and Languages. World Scientific, Singapore (2004)

    Book  MATH  Google Scholar 

  6. Martyugin, P.V.: A Lower Bound for the Length of the Shortest Carefully Synchronizing Words. Russian Mathematics (Iz. VUZ) 54(1), 46–54 (2010)

    MATH  Google Scholar 

  7. Gazdag, Z., Ivan, S., Nagy-Gyorgy, J.: Improved upper bounds on synchronizing non-deterministic automata. Information Processing Letters 109(17), 986–990 (2009)

    Article  MathSciNet  Google Scholar 

  8. Kozen, D.: Lower bounds for natural proof systems. In: Proceedings of the 18th Annual Symposium on Foundations of Computer Science, pp. 254–266 (1977)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Ural State University, 620083, Ekaterinburg, Russia

    P. V. Martyugin

Authors
  1. P. V. Martyugin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. of Theoretical Cybernetics, Kazan State University, 420008, Kazan, Russia

    Farid Ablayev

  2. Institut für Informatik, Technische Universität München, 85748, Garching, Germany

    Ernst W. Mayr

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Martyugin, P.V. (2010). Complexity of Problems Concerning Carefully Synchronizing Words for PFA and Directing Words for NFA. In: Ablayev, F., Mayr, E.W. (eds) Computer Science – Theory and Applications. CSR 2010. Lecture Notes in Computer Science, vol 6072. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13182-0_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-13182-0_27

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation