Cellular Automata with Infinite Number of Subshift Attractors
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11620%2F07%3A00000013" target="_blank" >RIV/00216208:11620/07:00000013 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Cellular Automata with Infinite Number of Subshift Attractors
Original language description
We argue that the complexity of a cellular automaton is reflected in the complexity of the lattice of its subshift attractors We construct cellular automata with infinite lattice of subshift attractors of arbitrarily high complexity
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
—
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2007
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Complex Systems
ISSN
0891-2513
e-ISSN
—
Volume of the periodical
17
Issue of the periodical within the volume
3
Country of publishing house
US - UNITED STATES
Number of pages
12
Pages from-to
—
UT code for WoS article
—
EID of the result in the Scopus database
—