Learning Probabilistic Automata and Markov Chains via Queries

ISSN： 0885-6125

Source： Machine Learning, Vol.08, Iss.2, 1992-03, pp. : 151-166

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Estimation of Finite Probabilities via Aggregation of Markov Chains

By Karmanov A. Karmanova L.

Automation and Remote Control, Vol. 66, Iss. 10, 2005-10 ,pp. : 1640-1646

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

Properties of probabilistic pushdown automata

By Macarie I.I. Ogihara M.

Theoretical Computer Science, Vol. 207, Iss. 1, 1998-10 ,pp. : 117-130

Elsevier

Access to resources Recommend Favorite

On probabilistic timed automata

By Beauquier D.

Theoretical Computer Science, Vol. 292, Iss. 1, 2003-01 ,pp. : 65-84

Elsevier

Access to resources Recommend Favorite

Analyzing probabilistic pushdown automata

By Brázdil Tomáš Esparza Javier Kiefer Stefan Kučera Antonín

Formal Methods in System Design, Vol. 43, Iss. 2, 2013-10 ,pp. : 124-163

Springer Publishing Company

Access to resources Recommend Favorite

Model checking for probabilistic timed automata

By Norman Gethin Parker David Sproston Jeremy

Formal Methods in System Design, Vol. 43, Iss. 2, 2013-10 ,pp. : 164-190

Springer Publishing Company

Access to resources Recommend Favorite