Skip to main content
SpringerLink
Log in

Complexity of Problems Concerning Reset Words for Cyclic and Eulerian Automata

  • Conference paper
Implementation and Application of Automata (CIAA 2011)

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

Included in the following conference series:

Abstract

A word is called a reset word for a deterministic finite automaton if it maps all states of this automaton to one state. We consider two classes of automata: cyclic automata and Eulerian automata. For these classes we study the computational complexity of the following problems: does there exist a reset word of given length for a given automaton? what is the minimal length of the reset words for a given 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., Volkov, M.V.: Synchronizing monotonic automata Theoret. Theoret. Comput. Sci. 327, 225–239 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  2. Berlinkov, M.V.: Approximating the Minimum Length of Synchronizing Words Is Hard. In: Ablayev, F., Mayr, E.W. (eds.) CSR 2010. LNCS, vol. 6072, pp. 37–47. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  3. Černý, J.: Poznámka k homogénnym eksperimentom s konecnými avtomatami, Mat.-Fyz. Čas. Slovensk. Akad. Vied. 14, 208–216 (1964) (in Slovak)

    Google Scholar 

  4. Dubuc, L.: Surles automates circulaires et la conjecture de Černý, RAIRO Inform. Theor. Appl. 32, 21–34 (1998) (in French)

    MathSciNet  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  6. Kari, J.: Synchronizing finite automata on Eulerian digraphs. Theoret. Comput. Sci. 295, 223–232 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  7. Martyugin, P.: Complexity of problems concerning reset words for some partial cases of automata. Acta Cybernetica 19, 517–536 (2009)

    MathSciNet  MATH  Google Scholar 

  8. Olschewski, J., Ummels, M.: The Complexity of Finding Reset Words in Finite Automata. In: Hliněný, P., Kučera, A. (eds.) MFCS 2010. LNCS, vol. 6281, pp. 568–579. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

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

    MathSciNet  MATH  Google Scholar 

  10. Salomaa, A.: Composition sequences for functions over a finite domain. Theor. Comput. Sci. 292, 263–281 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  11. Volkov, M.V.: Synchronizing automata preserving a chain of partial orders. Theoret. Comput. Sci. 410, 3513–3519 (2009)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Ural State University, 620083, Ekaterinburg, Russia

    Pavel Martyugin

Authors
  1. Pavel Martyugin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Université Francois Rabelais Tours, 3, Place Jean Jaurès, 4100, Blois, France

    Béatrice Bouchou-Markhoff

  2. LITIS, Université de Rouen, 76801, Saint-Étienne du Rouvray Cedex, France

    Pascal Caron  & Jean-Marc Champarnaud  & 

  3. LI (Computer Laboratory), EPU-DI, 64 avenue Jean-Portalis, 37200, Tours, France

    Denis Maurel

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Martyugin, P. (2011). Complexity of Problems Concerning Reset Words for Cyclic and Eulerian Automata. In: Bouchou-Markhoff, B., Caron, P., Champarnaud, JM., Maurel, D. (eds) Implementation and Application of Automata. CIAA 2011. Lecture Notes in Computer Science, vol 6807. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22256-6_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-22256-6_22

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-22255-9

  • Online ISBN: 978-3-642-22256-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation