Skip to main content
SpringerLink
Log in

Generalized Statistical Equivalence of Automata

  • Published:
Cybernetics and Systems Analysis Aims and scope

Abstract

The notion of generalized statistical equivalence of automata is introduced, and this equivalence is demonstrated to be weaker than the usual equivalence but stronger than the statistical equivalence of automata.

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. A. S. Barashko, “Mathematical principles of testing discrete devices by fragment counting,” Kibern. Sist. Anal., No. 2, 44-51 (1994).

    Google Scholar 

  2. A. S. Barashko, Yu. A. Skobtsov, and D. V. Speranskii, Simulation and Testing of Discrete Devices [in Russian], Naukova Dumka, Kiev (1992).

    Google Scholar 

  3. A. S. Barashko and A. N. Pavliv, “Generalized approach to statistical recognition of automata,” Kibern. Sist. Anal., No. 1, 46-56 (1998).

    Google Scholar 

  4. A. S. Barashko, “Properties of sequences generated by a generator of dependent random signals,” Dop. NAN Ukr., No. 3, 104-109 (1998).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Applied Mathematics and Mechanics, National Academy of Sciences of Ukraine, Donetsk, Ukraine

    A. S. Barashko

Authors
  1. A. S. Barashko
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Barashko, A.S. Generalized Statistical Equivalence of Automata. Cybernetics and Systems Analysis 36, 784–785 (2000). https://doi.org/10.1023/A:1009449411165

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1009449411165

Search

Navigation