Skip to main content
Conference Proceedings

Limit cycle for composited cellar automata

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2012) 7495 LNCS 32-41
DOI: 10.1007/978-3-642-33350-7_4
0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We know that a few uniform cellular automata have maximum cycle lengths. However, there are many uniform cellular automata, and checking the cycles of all uniform cellular automata is impractical. In this paper, we define a cellular automaton by composition and show how its cycles are related. © 2012 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Ishida, T., & Inokuchi, S. (2012). Limit cycle for composited cellar automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7495 LNCS, pp. 32–41). Springer Verlag. https://doi.org/10.1007/978-3-642-33350-7_4

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