Partially ordered classes of finite automata
- 1 January 1965
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
This paper is concerned with the algebraic structure of classes of automata, rather than single automata, with respect to several relations on these classes: certain equivalence relations like isomorphism and having identical semigroups, and certain partial order relations like being a homomorphic image or a subautomaton of another automaton. Several classes of automata are found to be lattices under certain partial orders.Keywords
This publication has 5 references indexed in Scilit:
- Methods of the algebraic theory of machinesJournal of Computer and System Sciences, 1967
- Isomorphism Groups of AutomataJournal of the ACM, 1962
- Loop-free structure of sequential machinesInformation and Control, 1962
- Symbolic analysis of a decomposition of information processing machinesInformation and Control, 1960
- Properties preserved under homomorphismPacific Journal of Mathematics, 1959