2013 IEEE 54th Annual Symposium on Foundations of Computer Science (1964)
Nov. 11, 1964 to Nov. 13, 1964
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/SWCT.1964.19
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.
R. E. Stearns, J. Hartmanis, "On the application of pair algebra to automata theory", 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, vol. 00, no. , pp. 192-196, 1964, doi:10.1109/SWCT.1964.19