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, 2020, Volume 32, Issue 2, Pages 44–60
DOI: https://doi.org/10.4213/dm1588 (Mi dm1588) 		 
This article is cited in 2 scientific papers (total in 2 papers)

Conditions of A-completeness for linear automata over dyadic rationals

D. V. Ronzhin

Lomonosov Moscow State University
Full-text PDF (499 kB) Citations (2)
References:
PDF
HTML
DOI: https://doi.org/10.4213/dm1588
Abstract: We consider the problem of $A$-completeness in the class of linear automata such that the sets of inputs, outputs and states are Cartesian products of dyadic rationals; systems checked for completeness are comprised of a variable finite set and a fixed additional set. We obtain conditions of $A$-completeness in terms of maximal subclasses in the cases when the additional set is the set of all unary automata and when the additional set consists of the adder.
Keywords: finite automata, linear automata, dyadic rationals, $A$-completeness, maximal subclasses.
Received: 07.08.2019
English version:
Discrete Mathematics and Applications, 2021, Volume 31, Issue 3, Pages 179–192
DOI: https://doi.org/10.1515/dma-2021-0016
Bibliographic databases:
Document Type: Article
UDC: 519.716.3
Language: Russian
Citation: D. V. Ronzhin, “Conditions of A-completeness for linear automata over dyadic rationals”, Diskr. Mat., 32:2 (2020), 44–60; Discrete Math. Appl., 31:3 (2021), 179–192
Citation in format AMSBIB
\Bibitem{Ron20}
\by D.~V.~Ronzhin
\paper Conditions of A-completeness for linear automata over dyadic rationals
\jour Diskr. Mat.
\yr 2020
\vol 32
\issue 2
\pages 44--60
\mathnet{http://mi.mathnet.ru/dm1588}
\crossref{https://doi.org/10.4213/dm1588}
\mathscinet{https://mathscinet.ams.org/mathscinet-getitem?mr=902758}
\elib{https://elibrary.ru/item.asp?id=46877894}
\transl
\jour Discrete Math. Appl.
\yr 2021
\vol 31
\issue 3
\pages 179--192
\crossref{https://doi.org/10.1515/dma-2021-0016}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000684255700003}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85109212805}
Linking options:
  • https://www.mathnet.ru/eng/dm1588
  • https://doi.org/10.4213/dm1588
  • https://www.mathnet.ru/eng/dm/v32/i2/p44
    • 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
    		Дискретная математика
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025