|
This article is cited in 2 scientific papers (total in 2 papers)
Maximum subclasses in classes of linear automata over finite fields
A. A. Chasovskikh Lomonosov Moscow State University
Abstract:
The sets of all maximum subclasses in classes of linear automata over finite fields are found. An algorithm that decides completeness of finite subsets based on maximum subclasses is formulated.
Keywords:
finite automaton, linear automaton, operation of composition, feedback, completeness, maximum subclass, finite field.
Received: 07.08.2019 Revised: 08.11.2019
Citation:
A. A. Chasovskikh, “Maximum subclasses in classes of linear automata over finite fields”, Diskr. Mat., 31:4 (2019), 88–101; Discrete Math. Appl., 30:6 (2020), 365–374
Linking options:
https://www.mathnet.ru/eng/dm1589https://doi.org/10.4213/dm1589 https://www.mathnet.ru/eng/dm/v31/i4/p88
|
Statistics & downloads: |
Abstract page: | 314 | Full-text PDF : | 37 | References: | 36 | First page: | 15 |
|