Abstract
In this work, we yield an attainable upper estimate of the degree of distinguishability of a connected permutation automaton with an assigned diameter.
Similar content being viewed by others
References
Gill, A., Introduction to the Theory of Finite-State Machines, McGraw-Hill, 1962.
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.
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.
Mur, E.F., Speculative experiments with sequential machines, in Sb. tr. Avtomaty (Collection of Works on Automata), Moscow, 1956, pp. 179–210.
Babash, A.V., Kriptograficheskie i teoretiko-avtomatnye aspekty sovremennoi zashchity informatsii (Cryptographic and Theoretical-Automatic Aspects of Modern Information Protection), Moscow: MESI, 2008.
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © A.V. Babash, 2016, published in Problemy Informatsionnoi Bezopasnosti, Komp’yuternye Sistemy.
About this article
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
Received:
Published:
Issue Date:
DOI: https://doi.org/10.3103/S0146411616080034