DocumentCode :
3263757
Title :
Partially ordered classes of finite automata
Author :
Nievergelt, J.
fYear :
1965
fDate :
6-8 Oct. 1965
Firstpage :
229
Lastpage :
234
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 :
Automata;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Switching Circuit Theory and Logical Design, 1965. SWCT 1965. Sixth Annual Symposium on
Conference_Location :
Ann Arbor, MI, USA
Type :
conf
DOI :
10.1109/FOCS.1965.22
Filename :
5397240
Link To Document :
بازگشت