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, 2011, Number 4(14), Pages 62–71 (Mi pdm346)  
This article is cited in 1 scientific paper (total in 1 paper)

Logical Design of Discrete Automata

State assignment in a discrete automaton targeting an implementing low power circuit

Yu. V. Pottosin

United Institute of Informatics Problems of the National Academy of Sciences of Belarus, Minsk, Belarus
Full-text PDF (687 kB) Citations (1)
References:
PDF
HTML
Abstract: The problem of the state assignment in a discrete automaton aimed to decrease the switching activity of memory elements in an implementing circuit is considered. A method for solving this problem based on an approach connected with the “desirable neighborhood” method is proposed.
Keywords: discrete automaton, state assignment.
Document Type: Article
UDC: 519.7
Language: Russian
Citation: Yu. V. Pottosin, “State assignment in a discrete automaton targeting an implementing low power circuit”, Prikl. Diskr. Mat., 2011, no. 4(14), 62–71
Citation in format AMSBIB
\Bibitem{Pot11}
\by Yu.~V.~Pottosin
\paper State assignment in a~discrete automaton targeting an implementing low power circuit
\jour Prikl. Diskr. Mat.
\yr 2011
\issue 4(14)
\pages 62--71
\mathnet{http://mi.mathnet.ru/pdm346}
Linking options:
  • https://www.mathnet.ru/eng/pdm346
  • https://www.mathnet.ru/eng/pdm/y2011/i4/p62
    • This publication is cited in the following 1 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Прикладная дискретная математика
    Statistics & downloads:
    Abstract page:359
    Full-text PDF :285
    References:39
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024