Prof. Niv Gilboa

We consider a distributed computation setting in which a party, whom we refer to as the dealer, has a finite state automaton (FSA) A with m states,which accepts an (a priori unbounded) stream of inputs x ₁, x ₂,... received from an external source. The dealer delegates the computation to agents A ₁,..., A _n, by furnishing them with an implementation of A. The input stream x ₁, x ₂,... 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 A and returns it as output.