Algorithmic decidability of the completeness problem for finite sets containing the zero constant in the class of definite linear automata

Ilya Vladimirovich Moldovanov

For citations:

Moldovanov I.V. Algorithmic decidability of the completeness problem for finite sets containing the zero constant in the class of definite linear automata. Chebyshevskii Sbornik. 2025;26(5):137-157. (In Russ.) https://doi.org/10.22405/2226-8383-2025-26-5-137-157

Views PDF (Rus): 9

JATS XML

This work is licensed under a Creative Commons Attribution 4.0 License.

ISSN 2226-8383 (Print)

Username
Password
	Remember me
Not a user? Register with this site Forgot your password?

User

Chebyshevskii Sbornik

For citations:

Cookies policy