Email this article Attainable upper estimate of the degree of distinguishability of a connected permutation automaton
- Authors: Babash A.V.1
-
Affiliations:
- National Research University Higher School of Economics
- Issue: Vol 50, No 8 (2016)
- Pages: 749-758
- Section: Article
- URL: https://journal-vniispk.ru/0146-4116/article/view/174722
- DOI: https://doi.org/10.3103/S0146411616080034
- ID: 174722
Cite item
Open Access
Access granted
Subscription Access
Abstract
In this work, we yield an attainable upper estimate of the degree of distinguishability of a connected permutation automaton with an assigned diameter.
About the authors
A. V. Babash
National Research University Higher School of Economics
Author for correspondence.
Email: babash@yandex.ru
Russian Federation, Moscow, 101000
Supplementary files
