Conditions of A-completeness for linear automata over dyadic rationals
-
Dmitriy V. Ronzhin
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.
Note: Originally published in Diskretnaya Matematika (2020) 32,№2, 44–60 (in Russian).
Acknowledgment
The author thanks his scientific supervisor A. A. Chasovskikh for problem formulation and assistance in research.
References
[1] Kudryavtsev V.B., Aleshin S.V., Podkolzin A.S., Introduction to Automata Theory, Nauka, Moscow, 1985 (in Russian), 320 pp.Search in Google Scholar
[2] Burevich V.A., “On completeness, A -completeness and t -completeness in the class of automaton mappings”, Intelligent Systems, 10:1-4 (2006), 613–638 (in Russian).Search in Google Scholar
[3] Babin D.N., Letunovskiy A.A., “On the possibilities of superposition, in the presence of a fixed additive of Boolean functions and delay in the basis of automata”, Intelligent Systems. Theory and applications, 19:3 (2015), 15–22 (in Russian).Search in Google Scholar
[4] Chasovskikh A.A., “Completeness problem for the class of linear automata functions”, Discrete Math. Appl., 26:2 (2016), 89–104.10.1515/dma-2016-0007Search in Google Scholar
[5] Ronzhin D.V., “Linear automata over the field of rational numbers”, Intelligent Systems. Theory and applications, 21:4 (2017), 144–155 (in Russian).Search in Google Scholar
© 2021 Walter de Gruyter GmbH, Berlin/Boston
Articles in the same Issue
- Frontmatter
- On the action of the implicative closure operator on the set of partial functions of the multivalued logic
- Bounds on Shannon functions of lengths of contact closure tests for contact circuits
- Conditions of A-completeness for linear automata over dyadic rationals
- Learning of monotone functions with single error correction
- Multitype weakly subcritical branching processes in random environment
- Convex algebras of probability distributions induced by finite associative rings
Articles in the same Issue
- Frontmatter
- On the action of the implicative closure operator on the set of partial functions of the multivalued logic
- Bounds on Shannon functions of lengths of contact closure tests for contact circuits
- Conditions of A-completeness for linear automata over dyadic rationals
- Learning of monotone functions with single error correction
- Multitype weakly subcritical branching processes in random environment
- Convex algebras of probability distributions induced by finite associative rings
