Skip to main content
SpringerLink
Log in

On the complexity of existence of homing sequences for nondeterministic finite state machines

  • Published:
Programming and Computer Software Aims and scope Submit manuscript

Abstract

The paper discusses complexity of the problem of checking existence of a homing sequence for an observable complete finite state machines (FSMs). The minimum length of such a sequence for FSMs of certain class is known to be exponential in the number of the FSM states. It is shown that the problem of checking the existence of such a sequence belongs to class PSPACE.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Gill, A., Introduction to Theory of Finite-State Machines, McGraw-Hill, 1962.

    MATH  Google Scholar 

  2. Martyugin, P.V., Length estimates and computational complexity of synchronization of finite state machines, Cand. Sci. (Phys.-Mat.) Dissertation, Yekaterinburg, 2008.

    Google Scholar 

  3. Ananichev, D.S. and Volkov, M.V., Synchronizing generalized monotonic automata, Theor. Comput. Sci., 2005, vol. 330, no. 1, pp. 3–13.

    Article  MATH  MathSciNet  Google Scholar 

  4. Klyachko, A.A., Rystsov, I.K., and Spivak, M.A., On an extremum combinatorial problem related to estimationof length of a return word in automaton, Kibern., 1987, no. 2, pp. 16–21.

    Google Scholar 

  5. Kohavi, Z., Switching and Finite Automata Theory, New York: McGraw-Hill, 1978.

    MATH  Google Scholar 

  6. Agibalov, G.P. and Oranov, A.M., Lektsii po teorii konechnykh avtomatov (Lectures on Finite Automaton Theory), Tomsk: TGU, 1984.

    Google Scholar 

  7. Rystsov, I.K., Polynomial complete problems in automata theory, Information Processing Lett., 1983, vol. 16, no. 3, pp. 147–151.

    Article  MATH  MathSciNet  Google Scholar 

  8. Sandberg, S., Homing and synchronization sequences, Lecture Notes Comput. Sci., 2005, vol. 3472, pp. 5–33.

    Article  Google Scholar 

  9. Kushik, N., El-Fakih, K., and Yevtushenko, N., Preset and adaptive homing experiments for nondeterministic finite state machines, Lecture Notes Comput. Sci., 2011, vol. 6807, pp. 215–224.

    Article  MathSciNet  Google Scholar 

  10. Kushik, N. and Yevtushenko, N., On the length of homing sequences for nondeterministic finite state machines, Lecture Notes Comput. Sci., 2013, vol. 7982, pp. 220–231.

    Article  MathSciNet  Google Scholar 

  11. Kushik, N.G., Methods for synthesizing homing and distinguishing experiments with nondeterministic finite state machines, Cand. Sci. (Phys.-Mat.) Dissertation, Tomsk, 2013.

    Google Scholar 

  12. Kim T., Villa, T., Brayton, R., and Sangiovanni-Vincentelli, A., Synthesis of FSMs: Functional Optimization, Kluwer, 1997.

    Google Scholar 

  13. Yevtushenko, N.V., Petrenko, A.F., and Vetrova, M.V., Nedeterminirovannye avtomaty: analiz i sintez (Nondeterministic Automata: Analysis and Synthesis) Tomsk: TGU, 2006.

    Google Scholar 

  14. Starke, P., Abstract Automata, Elsevier, 1972.

    MATH  Google Scholar 

  15. Savitch, W.J., Relationships between nondeterministic and deterministic tape complexities, J. Comput. System Sci., 1970, vol. 4, pp. 177–192.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Tomsk State University, ul. Lenina 36, Tomsk, 634050, Russia

    N. G. Kushik & N. V. Evtushenko

  2. Institute of System Programming, Russian Academy of Sciences, ul. Solzhenitsyna 25, Moscow, 109004, Russia

    V. V. Kulyamin

Authors
  1. N. G. Kushik
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. V. V. Kulyamin
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. N. V. Evtushenko
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to N. G. Kushik.

Additional information

Original Russian Text © N.G. Kushik, V.V. Kulyamin, N.V. Evtushenko, 2014, published in Programmirovanie, 2014, Vol. 40, No. 6.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kushik, N.G., Kulyamin, V.V. & Evtushenko, N.V. On the complexity of existence of homing sequences for nondeterministic finite state machines. Program Comput Soft 40, 333–336 (2014). https://doi.org/10.1134/S0361768814060140

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0361768814060140

Keywords

Search

Navigation