Pages that link to "Item:Q2892790"
From MaRDI portal
The following pages link to On the Complexity of the Equivalence Problem for Probabilistic Automata (Q2892790):
Displaying 18 items.
- Relations on words (Q505060) (← links)
- On the computational complexity of approximating distributions by probabilistic automata (Q1207305) (← links)
- The quest for minimal quotients for probabilistic and Markov automata (Q1784955) (← links)
- Language equivalence of probabilistic pushdown automata (Q2252520) (← links)
- One-way bounded-error probabilistic pushdown automata and Kolmogorov complexity (preliminary report) (Q2408814) (← links)
- Emptiness Under Isolation and the Value Problem for Hierarchical Probabilistic Automata (Q2988371) (← links)
- (Q3323274) (← links)
- Efficient Computation of the Relative Entropy of Probabilistic Automata (Q3525770) (← links)
- (Q3573985) (← links)
- (Q3975178) (← links)
- A Polynomial-Time Algorithm for the Equivalence of Probabilistic Automata (Q3990650) (← links)
- (Q4782099) (← links)
- (Q5015284) (← links)
- Universal Equivalence and Majority of Probabilistic Programs over Finite Fields (Q5056363) (← links)
- Undecidable Problems for Probabilistic Network Programming (Q5111285) (← links)
- Stability and Complexity of Minimising Probabilistic Automata (Q5167844) (← links)
- Artin’s Conjecture and Size of Finite Probabilistic Automata (Q5452183) (← links)
- The complexity of probabilistic versus deterministic finite automata (Q6487443) (← links)