Sciweavers

84 search results - page 2 / 17
» The Computational Power of Benenson Automata
Sort
View
DMTCS
2010
137views Mathematics» more  DMTCS 2010»
13 years 2 months ago
Deterministic recognizability of picture languages with Wang automata
We present a model of automaton for picture language recognition, called Wang automaton, which is based on labeled Wang tiles. Wang automata combine features of both online tessell...
Violetta Lonati, Matteo Pradella
DLT
2009
13 years 3 months ago
On Stateless Multihead Finite Automata and Multihead Pushdown Automata
A stateless k-head two-way deterministic finite automaton (k-head 2DFA), has only one state, hence the designation stateless. Its transitions depends solely on the symbols currentl...
Pierluigi Frisco, Oscar H. Ibarra
CMSB
2011
Springer
12 years 5 months ago
The singular power of the environment on stochastic nonlinear threshold Boolean automata networks
Abstract. This paper tackles theoretically the question of the structural stability of biological regulation networks subjected to the influence of their environment. The model of...
Jacques Demongeot, Sylvain Sené
FOCS
1997
IEEE
13 years 9 months ago
On the Power of Quantum Finite State Automata
In this paper, we introduce 1-way and 2-way quantum nite state automata (1qfa's and 2qfa's), which are the quantum analogues of deterministic, nondeterministic and proba...
Attila Kondacs, John Watrous
DNA
2008
Springer
121views Bioinformatics» more  DNA 2008»
13 years 7 months ago
Isothermal Reactivating Whiplash PCR for Locally Programmable Molecular Computation
Whiplash PCR (WPCR), due to Hagiya et al. [1], is a novel technique for autonomous molecular computation where a state machine is implemented with a single stranded DNA molecule a...
John H. Reif, Urmi Majumder