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


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




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

Diskretnaya Matematika, 2015, Volume 27, Issue 2, Pages 134–151
DOI: https://doi.org/10.4213/dm1330 (Mi dm1330) 		 
This article is cited in 13 scientific papers (total in 13 papers)

Completeness problem for the class of linear automata functions

Anatoliy A. Chasovskikh

Lomonosov Moscow State University
Full-text PDF (445 kB) Citations (13)
References:
PDF
HTML
DOI: https://doi.org/10.4213/dm1330
Abstract: We consider the classes of linear automata functions over finite fields with composition (superposition and feedback) operation and describe an algorithm that decides whether a finite set of functions from such class is complete. Thus we generalize the result that was known for the case of linear automata functions over prime finite fields.
Keywords: finite automaton, linear automata function, composition operation, superposition operation, feedback, completeness problem, completeness criterion, precomplete classes, adder, delay.
Received: 17.03.2015
English version:
Discrete Mathematics and Applications, 2016, Volume 26, Issue 2, Pages 89–104
DOI: https://doi.org/10.1515/dma-2016-0007
Bibliographic databases:
Document Type: Article
UDC: 519.716.3
Language: Russian
Citation: Anatoliy A. Chasovskikh, “Completeness problem for the class of linear automata functions”, Diskr. Mat., 27:2 (2015), 134–151; Discrete Math. Appl., 26:2 (2016), 89–104
Citation in format AMSBIB
\Bibitem{Cha15}
\by Anatoliy A. Chasovskikh
\paper Completeness problem for the class of linear automata functions
\jour Diskr. Mat.
\yr 2015
\vol 27
\issue 2
\pages 134--151
\mathnet{http://mi.mathnet.ru/dm1330}
\crossref{https://doi.org/10.4213/dm1330}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=3468396}
\elib{https://elibrary.ru/item.asp?id=24073699}
\transl
\jour Discrete Math. Appl.
\yr 2016
\vol 26
\issue 2
\pages 89--104
\crossref{https://doi.org/10.1515/dma-2016-0007}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000375870900002}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-84968732876}
Linking options:
  • https://www.mathnet.ru/eng/dm1330
  • https://doi.org/10.4213/dm1330
  • https://www.mathnet.ru/eng/dm/v27/i2/p134
    • This publication is cited in the following 13 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретная математика
    Statistics & downloads:
    Abstract page:483
    Full-text PDF :202
    References:67
    First page:38
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025