Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations
Work
Year: 2009
Type: article
Abstract: We define Recursive Markov Chains (RMCs), a class of finitely presented denumerable Markov chains, and we study algorithms for their analysis. Informally, an RMC consists of a collection of finite-sta... more
Source: Journal of the ACM
Authors Kousha Etessami, Mihalis Yannakakis
Institutions University of Edinburgh, Columbia University
Cites: 76
Cited by: 550
Related to: 10
FWCI: 49.88
Citation percentile (by year/subfield): 99.99
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Sustainable Development Goal Peace, justice, and strong institutions
Open Access status: green
Grant ID CCF-04-30946CCF-07-28736