Displaying similar documents to “The compositional construction of Markov processes II”

The compositional construction of Markov processes II

L. de Francesco Albasini, N. Sabadini, R. F.C. Walters (2011)

RAIRO - Theoretical Informatics and Applications

Similarity:

We add sequential operations to the categorical algebra of weighted and Markov automata introduced in [L. de Francesco Albasini, N. Sabadini and R.F.C. Walters, 
]. The extra expressiveness of the algebra permits the description of hierarchical systems, and ones with evolving geometry. We make a comparison with the probabilistic automata of Lynch [ (2007) 977–1013].

Cutoff for samples of Markov chains

Bernard Ycart (2010)

ESAIM: Probability and Statistics

Similarity:

We study the convergence to equilibrium of samples of independent Markov chains in discrete and continuous time. They are defined as Markov chains on the fold Cartesian product of the initial state space by itself, and they converge to the direct product of copies of the initial stationary distribution. Sharp estimates for the convergence speed are given in terms of the spectrum of the initial chain. A cutoff phenomenon occurs in the sense that as tends to infinity, the total...

Universality of Reversible Hexagonal Cellular Automata

Kenichi Morita, Maurice Margenstern, Katsunobu Imai (2010)

RAIRO - Theoretical Informatics and Applications

Similarity:

We define a kind of cellular automaton called a hexagonal partitioned cellular automaton (HPCA), and study logical universality of a reversible HPCA. We give a specific 64-state reversible HPCA , and show that a Fredkin gate can be embedded in this cellular space. Since a Fredkin gate is known to be a universal logic element, logical universality of is concluded. Although the number of states of is greater than those of the previous...

Multi-dimensional sets recognizable in all abstract numeration systems

Émilie Charlier, Anne Lacroix, Narad Rampersad (2012)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Similarity:

We prove that the subsets of that are -recognizable for all abstract numeration systems are exactly the 1-recognizable sets. This generalizes a result of Lecomte and Rigo in the one-dimensional setting.

Multi-dimensional sets recognizable in all abstract numeration systems

Émilie Charlier, Anne Lacroix, Narad Rampersad (2012)

RAIRO - Theoretical Informatics and Applications

Similarity:

We prove that the subsets of that are -recognizable for all abstract numeration systems are exactly the 1-recognizable sets. This generalizes a result of Lecomte and Rigo in the one-dimensional setting.