Tiling problem and undecidability in cellular automata

2Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Article Outline: Glossary Definition of the Subject Introduction The Tiling Problem and Its Variants Undecidability in Cellular Automata Future Directions Acknowledgments Bibliography

Cite

CITATION STYLE

APA

Kari, J. (2012). Tiling problem and undecidability in cellular automata. In Computational Complexity: Theory, Techniques, and Applications (Vol. 9781461418009, pp. 3198–3211). Springer New York. https://doi.org/10.1007/978-1-4614-1800-9_198

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free