Abstract
A general scheme is investigated that is destined for obtaining estimates based on the cardinality of subsets of a fixed set of automata over some finite commutative-associative ring with unit element. A scheme is proposed to solve parametric systems of polynomial equations based on classes of associated elements of the ring. Some general characteristics of automata over the ring are established.
Full Text
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call