Weighted one-deterministic-counter automata
From MaRDI portal
Cites work
- A helpful result for proving inherent ambiguity
- A Polynomial-Time Algorithm for the Equivalence of Probabilistic Automata
- Analyzing probabilistic pushdown automata
- Bisimilarity of one-counter processes is PSPACE-complete
- Bisimilarity of probabilistic pushdown automata
- Bisimulation equivalence and regularity for real-time one-counter automata
- Deterministic one-counter automata
- Equivalence of deterministic one-counter automata is NL-complete
- Height-Deterministic Pushdown Automata
- scientific article; zbMATH DE number 3560737 (Why is no real title available?)
- scientific article; zbMATH DE number 2086674 (Why is no real title available?)
- Language equivalence of deterministic real-time one-counter automata is NL-complete
- Language equivalence of probabilistic pushdown automata
- Methods for quantitative analysis of probabilistic pushdown automata
- Model Checking Probabilistic Pushdown Automata
- On probabilistic pushdown automata
- On the Complexity of Equivalence and Minimisation for Q-weighted Automata
- On the definition of a family of automata
- Reasoning about Recursive Probabilistic Programs
- STACS 2005
- The equality problem for rational series with multiplicities in the tropical semiring is undecidable
- The equivalence problem for deterministic pushdown automata is decidable
- Visibly pushdown languages
Cited in
(2)
This page was built for publication: Weighted one-deterministic-counter automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6951694)
