Problemy Peredachi Informatsii
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

Problemy Peredachi Informatsii, 1987, Volume 23, Issue 1, Pages 89–96 (Mi ppi766)  
Automata Theory

Binary Programs and Their Realization by Asynchronous Automata

Yu. L. Sagalovich, A. A. Shalyto
Full-text PDF (1090 kB)
Abstract: We consider coding of states of asynchronous automata designed to evaluate systems of Boolean functions by means of binary programs. We show that for a fairly wide class of systems of Boolean functions race-proof state coding is irredundant.
Received: 27.11.1985
Revised: 12.06.1985
Document Type: Article
UDC: 621.391.1-503.5
Language: Russian
Citation: Yu. L. Sagalovich, A. A. Shalyto, “Binary Programs and Their Realization by Asynchronous Automata”, Probl. Peredachi Inf., 23:1 (1987), 89–96; Problems Inform. Transmission, 23:1 (1987), 74–80
Citation in format AMSBIB
\Bibitem{SagSha87}
\by Yu.~L.~Sagalovich, A.~A.~Shalyto
\paper Binary Programs and Their Realization by Asynchronous Automata
\jour Probl. Peredachi Inf.
\yr 1987
\vol 23
\issue 1
\pages 89--96
\mathnet{http://mi.mathnet.ru/ppi766}
\transl
\jour Problems Inform. Transmission
\yr 1987
\vol 23
\issue 1
\pages 74--80
Linking options:
  • https://www.mathnet.ru/eng/ppi766
  • https://www.mathnet.ru/eng/ppi/v23/i1/p89
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Проблемы передачи информации Problems of Information Transmission
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024