Sciweavers

500 search results - page 66 / 100
» Universality and Cellular Automata
Sort
View
CONCUR
2009
Springer
14 years 3 months ago
Probabilistic Weighted Automata
Nondeterministic weighted automata are finite automata with numerical weights on transitions. They define quantitative languages L that assign to each word w a real number L(w). ...
Krishnendu Chatterjee, Laurent Doyen, Thomas A. He...
JUCS
2007
208views more  JUCS 2007»
13 years 9 months ago
The Architecture and Circuital Implementation Scheme of a New Cell Neural Network for Analog Signal Processing
: It is a difficult problem that using cellular neural network to make up of analog signal processing circuit. This paper presented the architecture of new cellular neural network ...
Youren Wang, Zhiqiang Zhang, Jiang Cui
CMSB
2011
Springer
12 years 8 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é
ECAL
2003
Springer
14 years 2 months ago
A Universal Framework for Self-Replication
Abstract. Self-replication is a fundamental property of many interesting physical, formal and biological systems, such as crystals, waves, automata, and especially forms of natural...
Bryant Adams, Hod Lipson
CONCUR
2010
Springer
13 years 10 months ago
Mean-Payoff Automaton Expressions
Abstract. Quantitative languages are an extension of boolean languages that assign to each word a real number. Mean-payoff automata are finite automata with numerical weights on tr...
Krishnendu Chatterjee, Laurent Doyen, Herbert Edel...