Back to Search
Start Over
Discrete parabolas and circles on 2D cellular automata
- Source :
- Theoretical Computer Science, Theoretical Computer Science, 1999, 218 (2), ⟨10.1016/S0304-3975(98)00330-2⟩, Theoretical Computer Science, Elsevier, 1999, 218 (2), ⟨10.1016/S0304-3975(98)00330-2⟩
- Publication Year :
- 1999
- Publisher :
- HAL CCSD, 1999.
-
Abstract
- andpossiblythehexagonalnetwork. Wecallcell each pair {vertex,automaton A}.Such a system can be considered as a dynamical one. At one time t,the global state of the system is given by an application Γ −→ S,whichassigns to each cell a state of A.And,startingfromaninitialconfiguration,the whole system synchronously evolves, at discrete times, from one config-uration to the next one. This behavior is formalized through asequenceofconfigurations (Γ
- Subjects :
- Discrete mathematics
Vertex (graph theory)
General Computer Science
Algorithm complexity
[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]
[INFO.INFO-CV]Computer Science [cs]/Computer Vision and Pattern Recognition [cs.CV]
02 engineering and technology
State (functional analysis)
Cellular automaton
Whole systems
Automaton
Theoretical Computer Science
Combinatorics
020204 information systems
0202 electrical engineering, electronic engineering, information engineering
Automata theory
020201 artificial intelligence & image processing
ComputingMilieux_MISCELLANEOUS
Mathematics
Computer Science(all)
Subjects
Details
- Language :
- English
- ISSN :
- 18792294 and 03043975
- Database :
- OpenAIRE
- Journal :
- Theoretical Computer Science, Theoretical Computer Science, 1999, 218 (2), ⟨10.1016/S0304-3975(98)00330-2⟩, Theoretical Computer Science, Elsevier, 1999, 218 (2), ⟨10.1016/S0304-3975(98)00330-2⟩
- Accession number :
- edsair.doi.dedup.....c5bc2b7afe6c751c5a48320192f31d56