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, 2021, Volume 25, Issue 3, Pages 191–202 (Mi ista321)  

Part 3. Mathematical models

About finitely generated $A$ maximum-subclasses in the class of linear automata over dyadic rationals

D. V. Ronzhin

non-profit organization "New School"
References:
Abstract: This work concerns property of being finitely generated by operations of $A$-closing of found earlier maximum subclasses in the class of linear automata over the ring of dyadic rationals. We present the proof of the fact that two of them are not finitely generated, while others are finitely generated.
Keywords: finite state automata, linear automata, dyadic rationals, $A$-completeness, maximum subclasses, finitely generated.
Document Type: Article
Language: Russian
Citation: D. V. Ronzhin, “About finitely generated $A$ maximum-subclasses in the class of linear automata over dyadic rationals”, Intelligent systems. Theory and applications, 25:3 (2021), 191–202
Citation in format AMSBIB
\Bibitem{Ron21}
\by D.~V.~Ronzhin
\paper About finitely generated $A$ maximum-subclasses in the class of linear automata over dyadic rationals
\jour Intelligent systems. Theory and applications
\yr 2021
\vol 25
\issue 3
\pages 191--202
\mathnet{http://mi.mathnet.ru/ista321}
Linking options:
  • https://www.mathnet.ru/eng/ista321
  • https://www.mathnet.ru/eng/ista/v25/i3/p191
  • 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:46
    Full-text PDF :14
    References:20
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024