RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
General information
Latest issue
Archive
Impact factor
Guidelines for authors

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Probl. Peredachi Inf.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Probl. Peredachi Inf., 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.

Full text: PDF file (931 kB)
References: PDF file   HTML file

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

Bibliographic databases:

UDC: 621.391.1:681.5
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

Citation in format AMSBIB
\Bibitem{Bab07}
\by A.~V.~Babash
\paper On Reconstruction of Information on an Input Sequence in a Medvedev
Permutation Automaton Given the Initial and Final States
\jour Probl. Peredachi Inf.
\yr 2007
\vol 43
\issue 2
\pages 74--84
\mathnet{http://mi.mathnet.ru/ppi13}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=2333858}
\zmath{https://zbmath.org/?q=an:05277482}
\transl
\jour Problems Inform. Transmission
\yr 2007
\vol 43
\issue 2
\pages 132--142
\crossref{https://doi.org/10.1134/S0032946007020068}
\isi{http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&DestLinkType=FullRecord&DestApp=ALL_WOS&KeyUT=000255782600006}
\scopus{http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-34547462105}


Linking options:
  • http://mi.mathnet.ru/eng/ppi13
  • http://mi.mathnet.ru/eng/ppi/v43/i2/p74

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles

    This publication is cited in the following articles:
    1. Babash A.V., “Opredelenie vkhodnogo slova vektornogo perestanovochnogo avtomata po mnozhestvu par nachalnykh i zaklyuchitelnykh sostoyanii s pomoschyu veroyatnostnoi modeli mitsuru matsui (mitsuru matsui)”, Voprosy zaschity informatsii, 2011, no. 2, 18–25  elib
  • Проблемы передачи информации Problems of Information Transmission
    Number of views:
    This page:277
    Full text:98
    References:29
    First page:12

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020