Communications of the ACM
| Hi-index | 0.00 |
We consider a distributed computation setting in which a party, whom we refer to as the dealer, has a finite state automaton (FSA) $\mathcal{A}$ with m states,which accepts an (a priori unbounded) stream of inputs x1, x2,... received from an external source. The dealer delegates the computation to agents A1,...,An, by furnishing them with an implementation of $\mathcal{A}$. The input streamx1, x2,... is delivered to all agents in a synchronized manner during the online input-processing phase. Finally, given a signal from the dealer, the agents terminate the execution, submit their internal state to the dealer, who computes the state of $\mathcal{A}$ and returns it as output.