Abstract
Sets of Mealy and Moore automata over an arbitrary finite commutative-associative ring are investigated in which transition and output functions are linear combinations of functions of automaton states and functions of inputs. Subsets of strongly connected, reduced, and reversible automata and automata with permutation transition functions are characterized.
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
