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, 2018, Volume 22, Issue 2, Pages 151–153 (Mi ista24)  

This article is cited in 2 scientific papers (total in 2 papers)

The problem of completeness in the class of linear automata

A. A. Chasovskikh

Lomonosov Moscow State University, Faculty of Mechanics and Mathematics

Abstract: Classes of linear automata over finite fields with composition operations (superposition and feedback) are considered. Previously an algorithm for checking the completeness of finite subsets was obtained for these classes. In the case of a simple field, all precomplete classes whose set is a countable reduced criterial system are found. Previously in the general case the set of closed classes was constructed, which is a criterial system, including the family of classes generated by maximal fields in the transcendental extension of the finite field under consideration. For simple fields, all classes of this family were absorbed by other classes from the reduced criterial system. Therefore, in the present paper the family is being investigated in the case of finite fields that are not simple. It turned out that part of the elements of the family is also absorbed in this case, but also among its elements there are precomplete classes that are finitely generated and not contained among the precomplete classes of other families.

Keywords: linear automaton, adder, delay, feedback, composition operations, completeness check algorithm, precomplete class.

Full text: PDF file (220 kB)
References: PDF file   HTML file

Citation: A. A. Chasovskikh, “The problem of completeness in the class of linear automata”, Intelligent systems. Theory and applications, 22:2 (2018), 151–153

Citation in format AMSBIB
\Bibitem{Cha18}
\by A.~A.~Chasovskikh
\paper The problem of completeness in the class of linear automata
\jour Intelligent systems. Theory and applications
\yr 2018
\vol 22
\issue 2
\pages 151--153
\mathnet{http://mi.mathnet.ru/ista24}


Linking options:
  • http://mi.mathnet.ru/eng/ista24
  • http://mi.mathnet.ru/eng/ista/v22/i2/p151

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles

    This publication is cited in the following articles:
    1. A. A. Chasovskikh, “Privedennye kriterialnye sistemy predpolnykh klassov v klassakh lineinykh avtomatov nad konechnymi polyami”, Intellektualnye sistemy. Teoriya i prilozheniya, 22:4 (2018), 115–135  mathnet
    2. D. I. Vasilyev, È. È. Gasanov, V. B. Kudryavtsev, “On stabilization of an automaton model of migration processes”, Discrete Math. Appl., 30:2 (2020), 117–128  mathnet  crossref  crossref  isi  elib
  • Intelligent systems. Theory and applications
    Number of views:
    This page:58
    Full text:9
    References:2

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020