DocumentCode
2204631
Title
On the application of pair algebra to automata theory
Author
Stearns, R.E. ; Hartmanis, J.
fYear
1964
fDate
11-13 Nov. 1964
Firstpage
192
Lastpage
196
Abstract
In this paper, we define and discuss generalizations of partition pairs on sequential machines. The object of these generalizations is to suggest a unified approach to problems of information flow and machine structure.
Keywords
Algebra; Automata; Data mining; Lattices; Mathematics; Physics computing; Upper bound;
fLanguage
English
Publisher
ieee
Conference_Titel
Switching Circuit Theory and Logical Design, 1964 Proceedings of the Fifth Annual Symposium on
Conference_Location
Princeton, NJ, USA
Type
conf
DOI
10.1109/SWCT.1964.19
Filename
4569821
Link To Document