电邮这篇文章 Attainable upper estimate of the degree of distinguishability of a connected permutation automaton
- 作者: Babash A.V.1
-
隶属关系:
- National Research University Higher School of Economics
- 期: 卷 50, 编号 8 (2016)
- 页面: 749-758
- 栏目: Article
- URL: https://journals.rcsi.science/0146-4116/article/view/174722
- DOI: https://doi.org/10.3103/S0146411616080034
- ID: 174722
如何引用文章
开放存取
##reader.subscriptionAccessGranted##
订阅存取
详细
In this work, we yield an attainable upper estimate of the degree of distinguishability of a connected permutation automaton with an assigned diameter.
作者简介
A. Babash
National Research University Higher School of Economics
编辑信件的主要联系方式.
Email: babash@yandex.ru
俄罗斯联邦, Moscow, 101000
补充文件
