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.
Set email alert for when this publication receives citations?
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.