Abstract
A complete non-deterministic automaton may be viewed as a relational system with unary and binary relations. These relations must satisfy certain closure properties. On the basis of these properties, recent results concerning the representation of general relational systems as direct and subdirect products are specialized to more precise results for non-deterministic automata. For example, we prove that the representations of a non-deterministic automaton as a direct product correspond in a one-to-one way to certain families ofideals of the automaton. The ideal of an automaton are seen to play an essential role in describing its structure, and a number of the properties of ideals are delineated.
Similar content being viewed by others
References
G. Birkhoff,Lattice Theory, Amer. Math. Soc. Colloq. Publ., Amer. Math. Soc., Providence, Rhode Island, 1948.
O. Ore, Theory of equivalence relations,Duke Math. J. 9 (1942), 573–627.
H. E. Pickett, Subdirect representations of relational systems,Fund. Math. 56 (1964), 223–240.
H. E. Pickett,Theory of Relational Algebras, Unpublished Manuscript.
M. Rabin andD. Scott, Finite automata and their decision problems,IBM J. Res. Develop. 3 (1959), 114–125.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Pickett, H.E. Direct and subdirect product structure theorems for non-deterministic automata. Math. Systems Theory 4, 357–372 (1970). https://doi.org/10.1007/BF01704079
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01704079