Get 20M+ Full-Text Papers For Less Than $1.50/day. Subscribe now for You or Your Team.

Learn More →

P-completeness of Cellular Automaton Rule 110

P-completeness of Cellular Automaton Rule 110 http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Automata, Languages and Programming, Lecture Notes in Computer Science CrossRef

P-completeness of Cellular Automaton Rule 110

Automata, Languages and Programming, Lecture Notes in Computer Science : 132-143 – Jan 1, 2006

P-completeness of Cellular Automaton Rule 110

Automata, Languages and Programming, Lecture Notes in Computer Science : 132-143 – Jan 1, 2006

Loading next page...
 
/lp/crossref/p-completeness-of-cellular-automaton-rule-110-TFVdJfPQXl

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
CrossRef
ISSN
0302-9743
DOI
10.1007/11786986_13
Publisher site
See Article on Publisher Site

Abstract

Journal

Automata, Languages and Programming, Lecture Notes in Computer ScienceCrossRef

Published: Jan 1, 2006

There are no references for this article.