Language equivalence of probabilistic pushdown automata
Authors:
- Vojtěch ForejtVFVojtěch Forejt
- Petr JančarPJPetr Jančar
- Stefan KieferSKStefan Kiefer
- James WorrellJWJames Worrell
- 1 October 2014
- journal article
- Published by Elsevier in Information and Computation
- Vol. 237, 1-11
Abstract
No abstract availableKeywords
Funding Information
- Royal Society
- Grant Agency of the Czech Rep. (GAČR:P202/11/0340)
This publication has 8 references indexed in Scilit:
- On the Complexity of Numerical AnalysisSIAM Journal on Computing, 2009
- Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equationsJournal of the ACM, 2009
- Deciding probabilistic bisimilarity over infinite-state probabilistic systemsActa Informatica, 2007
- L(A)=L(B)? decidability results from complete formal systemsTheoretical Computer Science, 2001
- A polynomial algorithm for deciding bisimilarity of normed context-free processesTheoretical Computer Science, 1996
- On the computational complexity and geometry of the first-order theory of the reals. Part I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the realsJournal of Symbolic Computation, 1992
- On greibach normal form constructionTheoretical Computer Science, 1985
- Matrix Equations and Normal Forms for Context-Free GrammarsJournal of the ACM, 1967