Title :
On the application of pair algebra to automata theory
Author :
Stearns, R.E. ; Hartmanis, J.
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;
Conference_Titel :
Switching Circuit Theory and Logical Design, 1964 Proceedings of the Fifth Annual Symposium on
Conference_Location :
Princeton, NJ, USA
DOI :
10.1109/SWCT.1964.19
