We describe an algebra for composing automata in which the actions have probabilities. We illustrate by showing how to calculate the probability of reaching deadlock in k steps in...
Luisa de Francesco Albasini, Nicoletta Sabadini, R...
The process of gene assembly in ciliates, an ancient group of organisms, is one of the most complex instances of DNA manipulation known in any organisms. This process is fascinatin...
Tero Harju, Chang Li, Ion Petre, Grzegorz Rozenber...
PA is the process algebra allowing non-determinism, sequential and parallel compositions, and recursion. We suggest viewing PA-processes as trees, and using treeautomata technique...
— In this paper, we propose a novel low complexity soft-in soft-out (SISO) equalizer using the Markov chain Monte Carlo (MCMC) technique. Direct application of MCMC to SISO equal...
In this paper, we propose novel low-complexity soft-in soft-out (SISO) equalizers using the Markov chain Monte Carlo (MCMC) technique. We develop a bitwise MCMC equalizer (b-MCMC) ...