Recurrence and transience for finite probabilistic tables
DOI10.1016/J.TCS.2010.12.038zbMATH Open1207.68226OpenAlexW2029319064MaRDI QIDQ631776FDOQ631776
Authors: Mathieu Tracol 
Publication date: 14 March 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2010.12.038
Recommendations
Markov chainsprobabilistic automatarecurrencenon-homogeneous Markov chainsfinite probabilistic tables
Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Cites Work
- The complexity of probabilistic verification
- Probabilistic automata
- Title not available (Why is that?)
- Non-negative matrices and Markov chains.
- Relationships between nondeterministic and deterministic tape complexities
- Probabilistic automata on finite words: decidable and undecidable problems
- On Decision Problems for Probabilistic Büchi Automata
- Ergodic Theorems for Infinite Probabilistic Tables
- Finite Continuous Time Markov Chains
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Tools and Algorithms for the Construction and Analysis of Systems
- Tail events of simulated annealing Markov chains
- Products of stochastic matrices and applications
- Recurrence and transience for probabilistic automata
- On the Tail $\Sigma$-Algebra of the Finite Inhomogeneous Markov Chains
- Power of Randomization in Automata on Infinite Strings
This page was built for publication: Recurrence and transience for finite probabilistic tables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q631776)
