20th Annual Symposium on Foundations of Computer Science (sfcs 1979) (1979)
Oct. 29, 1979 to Oct. 31, 1979
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/SFCS.1979.23
Using a pair of finite-state automata to model the transmitter-receiver protocol in a data communications system, we derive lower bounds on the size of automata needed to achieve reliable communication across an error-phone channel. We also show that, at the cost of increasing the size of the automata, a transmission rate close to the theoretical maximum can be achieved.
J. D. Ullman, M. Yannakakis and A. V. Aho, "Modeling communications protocols by automata," 20th Annual Symposium on Foundations of Computer Science (sfcs 1979)(FOCS), vol. 00, no. , pp. 267-273, 1979.