Sciweavers

22 search results - page 4 / 5
» Random Generation of Deterministic Tree (Walking) Automata
Sort
View
CORR
2008
Springer
107views Education» more  CORR 2008»
14 years 11 months ago
Maximum Entropy Rate of Markov Sources for Systems With Non-regular Constraints
Using the concept of discrete noiseless channels, it was shown by Shannon in A Mathematical Theory of Communication that the ultimate performance of an encoder for a constrained sy...
Georg Böcherer, Valdemar Cardoso da Rocha Jr....
CORR
2010
Springer
103views Education» more  CORR 2010»
14 years 11 months ago
Probabilistic regular graphs
Deterministic graph grammars generate regular graphs, that form a structural extension of configuration graphs of pushdown systems. In this paper, we study a probabilistic extensio...
Nathalie Bertrand, Christophe Morvan
ICS
2010
Tsinghua U.
15 years 9 months ago
Cryptography by Cellular Automata or How Fast Can Complexity Emerge in Nature?
Computation in the physical world is restricted by the following spatial locality constraint: In a single unit of time, information can only travel a bounded distance in space. A ...
Benny Applebaum, Yuval Ishai, Eyal Kushilevitz
CORR
2010
Springer
162views Education» more  CORR 2010»
14 years 11 months ago
Random sampling of lattice paths with constraints, via transportation
We investigate Monte Carlo Markov Chain (MCMC) procedures for the random sampling of some one-dimensional lattice paths with constraints, for various constraints. We will see that...
Lucas Gerin
BIOSYSTEMS
2008
129views more  BIOSYSTEMS 2008»
14 years 11 months ago
Reconstruction of DNA sequences using genetic algorithms and cellular automata: Towards mutation prediction?
Change of DNA sequence that fuels evolution is, to a certain extent, a deterministic process because mutagenesis does not occur in an absolutely random manner. So far, it has not ...
Ch. Mizas, Georgios Ch. Sirakoulis, Vasilios A. Ma...