Language classes defined by time-bounded relativised cellular automata
Meena Mahajan, Kamala Krithivasan (1993)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Displaying similar documents to “The laterality problem for non-erasing Turing machines on is completely solved”
Language classes defined by time-bounded relativised cellular automata
Real time recognition with cellular automata : a meaningful example
V. Terrier (1993)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Part and Machine Partitioning Problem in Cellular Manufacturing: Multiple Machine Environment
S. Sofianopoulou (1996)
The Yugoslav Journal of Operations Research
Similarity:
On effective speed-up and long proofs of trivial theorems in formal theories
J. Hartmanis (1976)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Mechanisms of Cell Motion in Confined Geometries
R. J. Hawkins, R. Voituriez (2010)
Mathematical Modelling of Natural Phenomena
Similarity:
We present a simple mechanism of cell motility in a confined geometry, inspired by recent motility assays in microfabricated channels. This mechanism relies mainly on the coupling of actin polymerisation at the cell membrane to geometric confinement. We first show analytically using a minimal model of polymerising viscoelastic gel confined in a narrow channel that spontaneous motion occurs due to polymerisation alone. Interestingly, this ...
A note on separating the relativized polynomial time hierarchy by immune sets
Ker-I Ko (1990)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity: