Modeling communications protocols by automata

  • Authors:

  • A. V. Aho;J. D. Ullman;M. Yannakakis

  • Affiliations:

  • -;-;-

  • Venue:
  • SFCS '79 Proceedings of the 20th Annual Symposium on Foundations of Computer Science
  • Year:
  • 1979

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.