This article is cited 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.

UDC: 621.391.1:681.5

Received: 19.02.2002
Revised: 13.02.2007

 English version: Problems of Information Transmission, 2007, 43:2, 132–142

Bibliographic databases:

• 
• 
• 
•