Gregory Mone
Abstract
Scientists are using DNA and RNA to build the world's tiniest robots and computing devices.
- Cameron, N.E., Bashor, C.J., and Collins, J.J. A brief history of synthetic biology. Nature Reviews Microbiology, May 2014.Google Scholar
Cross Ref
- Jung, C., Allen, P.B., and Ellington, A.D. A stochastic DNA walker that traverses a microparticle surface. Nature Nanotechnology, February 2016.Google ScholarCross Ref
- Thubagere, A.J., Li, W., Johnson, R.F., et. al. A cargo-sorting DNA robot, Science, Vol. 357, Issue 6356.Google Scholar
- Nielson, A.A.K., Der, B.S., Shin, J., et. al. Genetic circuit design automation, Science, Vol. 352, Issue 6281.Google Scholar
Index Terms
- Shrinking machines, cellular computers
Recommendations
Shrinking one-way cellular automata
We investigate cellular automata as acceptors for formal languages. In particular, we consider real-time one-way cellular automata ($$\text{OCA}$$OCA) with the additional property that during a computation any cell of the $$\text{OCA}$$OCA has the ...
Shrinking restarting automata
MFCS'05: Proceedings of the 30th international conference on Mathematical Foundations of Computer ScienceRestarting automata are a restricted model of computation that is motivated by the so-called analysis by reduction. A computation of a restarting automaton consists of a sequence of cycles such that in each cycle the automaton performs exactly one ...
Emptiness Is Decidable for Asynchronous Cellular Machines
CONCUR '00: Proceedings of the 11th International Conference on Concurrency TheoryWe resume the investigation of asynchronous cellular automata. Originally, these devices were considered in the context of Mazurkiewicz traces, and later generalized to run on arbitrary pomsets without autoconcurrency by Droste and Gastin [3]. While the ...
Comments