|
Problemy Peredachi Informatsii, 2007, Volume 43, Issue 2, Pages 74–84
(Mi ppi13)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
Automata Theory
On Reconstruction of Information on an Input Sequence in a Medvedev
Permutation Automaton Given the Initial and Final States
A. V. Babash Academy of Federal Security Service of Russian Federation
Abstract:
We give a description of Medvedev permutation automata for which approximate
reconstruction of information on an input word is possible given initial and final states corresponding
to the input word.
Received: 19.02.2002 Revised: 13.02.2007
Citation:
A. V. Babash, “On Reconstruction of Information on an Input Sequence in a Medvedev
Permutation Automaton Given the Initial and Final States”, Probl. Peredachi Inf., 43:2 (2007), 74–84; Problems Inform. Transmission, 43:2 (2007), 132–142
Linking options:
https://www.mathnet.ru/eng/ppi13 https://www.mathnet.ru/eng/ppi/v43/i2/p74
|
Statistics & downloads: |
Abstract page: | 352 | Full-text PDF : | 134 | References: | 51 | First page: | 12 |
|