This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
1964 Proceedings of the Fifth Annual Symposium on Switching Circuit Theory and Logical Design
On the application of pair algebra to automata theory
November 11-November 13
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.
Citation:
R. E. Stearns, J. Hartmanis, "On the application of pair algebra to automata theory," focs, pp.192-196, 1964 Proceedings of the Fifth Annual Symposium on Switching Circuit Theory and Logical Design, 1964
Usage of this product signifies your acceptance of the Terms of Use.