Skip to main content
Log in

Attainable upper estimate of the degree of distinguishability of a connected permutation automaton

  • Published:
Automatic Control and Computer Sciences Aims and scope Submit manuscript

Abstract

In this work, we yield an attainable upper estimate of the degree of distinguishability of a connected permutation automaton with an assigned diameter.

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

Access this article

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 the Theory of Finite-State Machines, McGraw-Hill, 1962.

    MATH  Google Scholar 

  2. Ginsburg, S., On the length of the shortest uniform experiment setting the final status of the machine, Kibern. Sb., 1961, no. 3, pp. 167–186.

    Google Scholar 

  3. Korshunov, A.D., On the degree of distinctiveness of finite automata, in Sb. tr. Diskretnyi analiz (Collection of Works on Discrete Analysis), Novosibirsk: Nauka, 1967, vol. 10, pp. 39–59.

    Google Scholar 

  4. Mur, E.F., Speculative experiments with sequential machines, in Sb. tr. Avtomaty (Collection of Works on Automata), Moscow, 1956, pp. 179–210.

    Google Scholar 

  5. Babash, A.V., Kriptograficheskie i teoretiko-avtomatnye aspekty sovremennoi zashchity informatsii (Cryptographic and Theoretical-Automatic Aspects of Modern Information Protection), Moscow: MESI, 2008.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to A. V. Babash.

Additional information

Original Russian Text © A.V. Babash, 2016, published in Problemy Informatsionnoi Bezopasnosti, Komp’yuternye Sistemy.

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Babash, A.V. Attainable upper estimate of the degree of distinguishability of a connected permutation automaton. Aut. Control Comp. Sci. 50, 749–758 (2016). https://doi.org/10.3103/S0146411616080034

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.3103/S0146411616080034

Keywords

Navigation