Skip to main content
SpringerLink
Log in

Methods of constructing universal tests for finite-state automata

  • Automata
  • Published:
Automation and Remote Control Aims and scope Submit manuscript

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

REFERENCES

  1. Gill, A., Introduction to the Theory of Finite-State Machines, New York: McGraw-Hill, 1962. Translated under the title Vvedenie v meoriyu konechnykh avtomatov, Moscow: Nauka, 1966.

    Google Scholar 

  2. Tverdokhlebov, V.A., Universal Solution of the Automaton Recognition Problem, in Metody i sistemytekhnicheskoi diagnostiki (Method and Systems in Technical Diagnostics), Saratov: Sarat. Univ., 1981, vol. 2.

    Google Scholar 

  3. Tverdokhlebov, V.A., Universal Tests Generators and Diagnostic Systems, in Tekhn. Diagnostika (Technical Diagnostics), Rostov-on-Don: RISI, 1982.

    Google Scholar 

  4. Tverdokhlebov, V.A., Deterministic and Probabilistic Estimates of the Universal Tests, in Markovskie sluchainye protsessy i ikh primenenie (Markov Stochastic Processes and Applications), Saratov: Saratov.Univ., 1988, vol. 4.

    Google Scholar 

  5. Tverdokhlebov, V.A., Logicheskie eksperimenty s avtomatami (Logic Experiments with Automata), Saratov: Saratov. Univ., 1988.

    Google Scholar 

  6. Tverdokhlebov, V.A., Universal Tests in Technical Diagnosis, Proc. Fourth Int. Conf. “Computer-aided Design of Discrete Systems,” Minsk, 2001, vol. 3, pp. 6-13.

    Google Scholar 

  7. Aksenova, G.P. and Khalchev, V.F., Generation of the Exhaustive Test for Finite-memory Automata., Avtom. Telemekh., 1997, no. 4, pp. 213–226; no. 5, pp. 142-152.

  8. Moore, E.E., Sequential Machines, Reading: Addison-Wesley, 1964. Translated under the title Umozritel’nyi experiment s posledovatel’nostnymi mashinami. Avtomaty, Moscow: Inostrannaya Literatura,1966.

    Google Scholar 

  9. Lippel, B. and Epstein, I.J., A Method for Obtaining Complete Digital Coding Chains, IRE Trans., 1957, vol. EC-6, pp. 121.

    Google Scholar 

  10. Khibbard, T., Tochnye verkhnie granitsy dlin dlya minimal’nykh experimentov, Kibernet., vyp. 2.Moscow: Mir, 1966.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Fine Mechanics and Control, Russian Academy of Sciences, Saratov, Russia

    V. A. Tverdokhlebov

Authors
  1. V. A. Tverdokhlebov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Avtomatika i Telemekhanika, No. 1, 2005, pp. 154–163.

Original Russian Text Copyright © 2005 by Tverdokhlebov.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Tverdokhlebov, V.A. Methods of constructing universal tests for finite-state automata. Autom Remote Control 66, 139–147 (2005). https://doi.org/10.1007/s10513-005-0014-4

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10513-005-0014-4

Keywords

Search

Navigation