Abstract
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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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
