Prikladnaya Diskretnaya Matematika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Prikl. Diskr. Mat.:
Year:
Volume:
Issue:
Page:
Find




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

Prikladnaya Diskretnaya Matematika, 2009, supplement № 1, Pages 29–30 (Mi pdm79)  
Mathematical Methods of Cryptography, Steganography and Coding

Transitions identification experiments with information-lossless automata

V. N. Trenkaev
Full-text PDF (327 kB)
References:
PDF
HTML
Abstract: The paper addresses the problem of finite-state machine identification. To solve this problem, simple conditional experiments with automata are used. It is supposed that some automaton transitions are known. An heuristic approach is given to determine the unknown transitions.
Document Type: Article
UDC: 519.713
Language: Russian
Citation: V. N. Trenkaev, “Transitions identification experiments with information-lossless automata”, Prikl. Diskr. Mat., 2009, supplement № 1, 29–30
Citation in format AMSBIB
\Bibitem{Tre09}
\by V.~N.~Trenkaev
\paper Transitions identification experiments with information-lossless automata
\jour Prikl. Diskr. Mat.
\yr 2009
\pages 29--30
\issueinfo supplement № 1
\mathnet{http://mi.mathnet.ru/pdm79}
Linking options:
  • https://www.mathnet.ru/eng/pdm79
  • https://www.mathnet.ru/eng/pdm/y2009/i10/p29
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Прикладная дискретная математика
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024