Results 81 to 90 of about 1,964,103 (323)
Comparison of Evolutionary Development of Cellular Automata Using Various Representations
Mendel, 2019 A comparative study is presented regarding the evolutionary design of complex multi-state cellular automata. In particular, two-dimensional cellular automata will be considered in combination with pattern development problem as a~case study.
Michal Bidlo
doaj +1 more source
Celulární automat a CML systémy [PDF]
, 2018 The main aim of this thesis is the study of cellular automata and discrete dynamical systems on a lattice. Both tools, cellular automata as well as dynamical systems on a lattice are introduced and elementary properties described.
Štula, Václav
core
Renormalization group of probabilistic cellular automata with one absorbing state
, 1996 We apply a recently proposed dynamically driven renormalization group scheme to probabilistic cellular automata having one absorbing state. We have found just one unstable fixed point with one relevant direction.
A. Vespignani +14 more
core +1 more source
Self-verifying cellular automata [PDF]
, 2018 We study the computational capacity of self-verifying cellular automata with an emphasis on one-way information flow (SVOCA). A self-verifying device is a nondeterministic device whose nondeterminism is symmetric in the following sense.
A Malcher +16 more
core +1 more source
Hippo pathway at the crossroads of stemness and therapeutic resistance in breast cancer
Molecular Oncology, EarlyView.Dysregulation of the Hippo pathway drives nuclear accumulation of YAP/TAZ, activating stemness‐related transcriptional programs that sustain breast cancer stemness and fuel therapeutic resistance across subtypes, underscoring Hippo signaling as a targetable vulnerability. Figure created and edited with BioRender.com.
Giulia Schiavoni +11 more
wiley +1 more source
Number conserving cellular automata: new results on decidability and dynamics [PDF]
Discrete Mathematics & Theoretical Computer Science, 2003 This paper is a survey on our recent results about number conserving cellular automata. First, we prove the linear time decidability of the property of number conservation. The sequel focuses on dynamical evolutions of number conserving cellular automata.
Bruno Durand +3 more
doaj +1 more source
Density Classification Quality of the Traffic-majority Rules [PDF]
, 2015 The density classification task is a famous problem in the theory of cellular automata. It is unsolvable for deterministic automata, but recently solutions for stochastic cellular automata have been found.
Redeker, Markus
core
Definition and evolution of quantum cellular automata with two qubits per cell
, 2008 Studies of quantum computer implementations suggest cellular quantum computer architectures. These architectures can simulate the evolution of quantum cellular automata, which can possibly simulate both quantum and classical physical systems and ...
G. Grössing +2 more
core +1 more source
A universally programmable Quantum Cellular Automaton [PDF]
, 2005 We discuss the role of classical control in the context of reversible quantum cellular automata. Employing the structure theorem for quantum cellular automata, we give a general construction scheme to turn an arbitrary cellular automaton with external ...
D. J. Shepherd +3 more
core +1 more source
CCDC80 suppresses high‐grade serous ovarian cancer migration via negative regulation of B7‐H3
Molecular Oncology, EarlyView.PAX8 is a lineage‐specific master regulator of transcription in high‐grade serous ovarian cancer (HGSC) progression. We show for the first time that PAX8 facilitates proliferation and metastasis by repressing the cell autonomous tumor suppressor CCDC80 and inducing B7‐H3 expression.
Aya Saleh +12 more
wiley +1 more source