Strictly Temporally Periodic Points in Cellular Automata

Uloženo v:

Podrobná bibliografie
Vydáno v:	Electronic Proceedings in Theoretical Computer Science Ročník 90; s. 225 - 235
Hlavní autoři:	Alberto Dennunzio, DI LENA, PIETRO, MARGARA, LUCIANO
Médium:	Journal Article
Jazyk:	japonština
Vydáno:	Open Publishing Association 13.08.2012
Témata:	[INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC] [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM] [INFO]Computer Science [cs] [MATH.MATH-DS]Mathematics [math]/Dynamical Systems [math.DS] [NLIN.NLIN-AO]Nonlinear Sciences [physics]/Adaptation and Self-Organizing Systems [nlin.AO] [NLIN.NLIN-CD]Nonlinear Sciences [physics]/Chaotic Dynamics [nlin.CD] [NLIN.NLIN-CG]Nonlinear Sciences [physics]/Cellular Automata and Lattice Gases [nlin.CG] ACM: F.: Theory of Computation ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.1: Models of Computation ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.2: Modes of Computation ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.3: Complexity Measures and Classes Cellular Automata and Lattice Gases (nlin.CG) cellular automata, temporally periodic configurations CELLULAR AUTOMATA; PERIODIC POINTS Computational Complexity (cs.CC) Computer Science - Computational Complexity Computer Science - Discrete Mathematics Computer Science - Formal Languages and Automata Theory Discrete Mathematics (cs.DM) Electronic computers. Computer science F.1.1 F.1.1, F.1.2, F.1.3 F.1.2 F.1.3 Formal Languages and Automata Theory (cs.FL) FOS: Computer and information sciences FOS: Physical sciences Mathematics Nonlinear Sciences - Cellular Automata and Lattice Gases QA1-939 QA75.5-76.95
ISSN:	2075-2180
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Popis
ISSN:	2075-2180
DOI:	10.4204/eptcs.90.0