269 search results - page 29 / 54 » Computing with Probabilistic Cellular Automata |
DAC
2003
ACM
14 years 9 months ago
2003
ACM
Reseeding is used to improve fault coverage of pseudorandom testing. The seed corresponds to the initial state of the PRPG before filling the scan chain. In this paper, we present...
CONCUR
2009
Springer
14 years 3 months ago
2009
Springer
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). ...
TCS
2011
13 years 3 months ago
2011
This paper presents a 1D intrinsically universal cellular automaton with four states for a first neighbors neighborhood, improving on the previous lower bound and getting nearer ...
CONCUR
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. Polynomially accurate simulations [19] are relations for Probabilistic Automata that require transitions to be matched up to negligible sets provided that computation len...
FOSSACS
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. We study a process calculus which combines both nondeterministic and probabilistic behavior in the style of Segala and Lynch’s probabilistic automata. We consider vario...