Results: 4
Reaction-Diffusion Automata: Three States Implies Universality.
- Published in:
- Theory of Computing Systems, 1997, v. 30, n. 3, p. 223, doi. 10.1007/s002240000051
- By:
- Publication type:
- Article
A Characterization and Nearly Linear-Time Equivalence Test for µ-Branching Programs.
- Published in:
- Theory of Computing Systems, 1997, v. 30, n. 3, p. 249, doi. 10.1007/s002240000053
- By:
- Publication type:
- Article
The Complexity of Deterministic PRAM Simulation on Distributed Memory Machines.
- Published in:
- Theory of Computing Systems, 1997, v. 30, n. 3, p. 231, doi. 10.1007/s002240000052
- By:
- Publication type:
- Article
Automatic Maps in Exotic Numeration Systems.
- Published in:
- Theory of Computing Systems, 1997, v. 30, n. 3, p. 285, doi. 10.1007/BF02679463
- By:
- Publication type:
- Article