Recurrence and transience for finite probabilistic tables

DOI10.1016/J.TCS.2010.12.038MaRDI QIDQ631776zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

Markov chainsprobabilistic automatarecurrencenon-homogeneous Markov chainsfinite probabilistic tables

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Recommendations

• Recurrence and transience for probabilistic automata
• Recurrence and transience of states for Markov chains in random environments
• scientific article; zbMATH DE number 4147239
• Tail events of some nonhomogeneous Markov chains
• scientific article; zbMATH DE number 1376763

Cites work

• scientific article; zbMATH DE number 3152029 (Why is no real title available?)
• scientific article; zbMATH DE number 3572058 (Why is no real title available?)
• scientific article; zbMATH DE number 1325007 (Why is no real title available?)
• scientific article; zbMATH DE number 3371972 (Why is no real title available?)
• Ergodic Theorems for Infinite Probabilistic Tables
• Finite Continuous Time Markov Chains
• Non-negative matrices and Markov chains.
• On Decision Problems for Probabilistic Büchi Automata
• On the Tail $\Sigma$-Algebra of the Finite Inhomogeneous Markov Chains
• Power of Randomization in Automata on Infinite Strings
• Probabilistic automata
• Probabilistic automata on finite words: decidable and undecidable problems
• Products of stochastic matrices and applications
• Recurrence and transience for probabilistic automata
• Relationships between nondeterministic and deterministic tape complexities
• Tail events of simulated annealing Markov chains
• The complexity of probabilistic verification
• Tools and Algorithms for the Construction and Analysis of Systems

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)