Intelligent systems. Theory and applications
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Intelligent systems. Theory and applications:
Year:
Volume:
Issue:
Page:
Find




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

Intelligent systems. Theory and applications, 2019, Volume 23, Issue 4, Pages 125–131 (Mi ista251)  
Part 3. Mathematical models

$A$-completeness of systems with additives of linear automata over the ring of dyadic rationals

D. V. Ronzhin
Full-text PDF (312 kB)
References:
PDF
HTML
Abstract: A brief description of results of $A$-completeness problem for linear finite state automata, functioning over the ring of dyadic rationals is given. Conditions of $A$-completeness for systems, containing all one-valued linear automata with finite additive and finite systems with a summing automaton are stated.
Keywords: finite state automata, linear automata, dyadic rationals, $A$-completeness, maximum subclasses.
Document Type: Article
Language: Russian
Citation: D. V. Ronzhin, “$A$-completeness of systems with additives of linear automata over the ring of dyadic rationals”, Intelligent systems. Theory and applications, 23:4 (2019), 125–131
Citation in format AMSBIB
\Bibitem{Ron19}
\by D.~V.~Ronzhin
\paper $A$-completeness of systems with additives of linear automata over the ring of dyadic rationals
\jour Intelligent systems. Theory and applications
\yr 2019
\vol 23
\issue 4
\pages 125--131
\mathnet{http://mi.mathnet.ru/ista251}
Linking options:
  • https://www.mathnet.ru/eng/ista251
  • https://www.mathnet.ru/eng/ista/v23/i4/p125
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Intelligent systems. Theory and applications
    Statistics & downloads:
    Abstract page:100
    Full-text PDF :28
    References:21
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025