Skip to main content

The new way of probabilistic compact testing

  • Conference paper
  • First Online:
Fundamentals of Computation Theory (FCT 1987)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 278))

Included in the following conference series:

  • 138 Accesses

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

Access this chapter

Institutional subscriptions

References

  1. Kazmina,S.K. Compact testing. Automatika i telemechanika. (1982), no.3, 173–189.

    Google Scholar 

  2. Kemeny, J.G.; Snell, J.L. Finite Markov chains. "Nauka", Moscow, 1970, 271 pp.

    Google Scholar 

  3. Fukunaga, K. Introduction to statistical pattern recognition. "Nauka", Moscow, 1979. 368 pp.

    Google Scholar 

  4. Bucharaev, R.G. Faundations of the probabilistic automata theory. "Nauka", Moscow, 1985. 287 pp.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Lothar Budach Rais Gatič Bukharajev Oleg Borisovič Lupanov

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Barashko, A.S. (1987). The new way of probabilistic compact testing. In: Budach, L., Bukharajev, R.G., Lupanov, O.B. (eds) Fundamentals of Computation Theory. FCT 1987. Lecture Notes in Computer Science, vol 278. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18740-5_13

Download citation

  • DOI: https://doi.org/10.1007/3-540-18740-5_13

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-18740-0

  • Online ISBN: 978-3-540-48138-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics