On the Periodic Representations and the Reducibility of Periodic Automata
Jerzy W. Grzymala‐Busse · Journal of the ACM · 1969
AnSTRACT.The problem of the existence of periodic representations of periodic, strongly connected automata is discussed.The notion of periodic representation, in a narrower sense than here, was introduced by Gill in 1963.The necessary and sufficient condition is given for the existence of periodic representations of a periodic, strongly connected automaton.Similarly, the necessary and sufficient condition is given for the here-defined reducibility of a polyadic, strongly connected automaton.This investigation of the class of polyadic automata is a continuation of the work in a recent paper by the author.