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

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


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




Diskretnaya Matematika, 2017, Volume 29, Issue 1, Pages 59–79
DOI: https://doi.org/10.4213/dm1406 (Mi dm1406) 		 
This article is cited in 2 scientific papers (total in 2 papers)

Linearly realizable automata

S. B. Rodin

Lomonosov Moscow State University
Full-text PDF (490 kB) Citations (2) English version article
References:
PDF
HTML
DOI: https://doi.org/10.4213/dm1406
Abstract: The paper is devoted to the investigation of “linearly realizable” automata, i.e. automata that allow state encodings that lead to implementations with linear Boolean operators. We formulate the criterion of linear realizability and obtain upper and lower bounds on the number of linearly realizable automata.
Keywords: automata theory, automata, semiautomata, transition systems, permutation, substitution function, assignment, state encoding, complexity.
Received: 21.11.2016
English version:
Discrete Mathematics and Applications, 2017, Volume 27, Issue 6, Pages 387–402
DOI: https://doi.org/10.1515/dma-2017-0039
Bibliographic databases:
Document Type: Article
UDC: 519.713.1
Language: Russian
Citation: S. B. Rodin, “Linearly realizable automata”, Diskr. Mat., 29:1 (2017), 59–79; Discrete Math. Appl., 27:6 (2017), 387–402
Citation in format AMSBIB
\Bibitem{Rod17}
\by S.~B.~Rodin
\paper Linearly realizable automata
\jour Diskr. Mat.
\yr 2017
\vol 29
\issue 1
\pages 59--79
\mathnet{http://mi.mathnet.ru/dm1406}
\crossref{https://doi.org/10.4213/dm1406}
\elib{https://elibrary.ru/item.asp?id=28405136}
\transl
\jour Discrete Math. Appl.
\yr 2017
\vol 27
\issue 6
\pages 387--402
\crossref{https://doi.org/10.1515/dma-2017-0039}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000417791200005}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85038373137}
Linking options:
  • https://www.mathnet.ru/eng/dm1406
  • https://doi.org/10.4213/dm1406
  • https://www.mathnet.ru/eng/dm/v29/i1/p59
    • This publication is cited in the following 2 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретная математика
    Statistics & downloads:
    Abstract page:544
    Full-text PDF :100
    References:99
    First page:37
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025