A Decidable Equivalence for a Turing-Complete, Distributed Model of Computation.

Arnaldo Cesco, Roberto Gorrieri

Browse the full MFCS paper archive.