Pages that link to "Item:Q3979858"
From MaRDI portal
The following pages link to On comparative complexity of probabilistic and deterministic automata (Q3979858):
Displaying 10 items.
- The complexity properties of probabilistic automata with isolated cut point (Q1102752) (← links)
- On the computational complexity of approximating distributions by probabilistic automata (Q1207305) (← links)
- On the Complexity of the Equivalence Problem for Probabilistic Automata (Q2892790) (← links)
- Efficient Computation of the Relative Entropy of Probabilistic Automata (Q3525770) (← links)
- (Q3970814) (← links)
- (Q3975178) (← links)
- (Q4782099) (← links)
- Stability and Complexity of Minimising Probabilistic Automata (Q5167844) (← links)
- Probabilism versus Alternation for Automata (Q6163621) (← links)
- The complexity of probabilistic versus deterministic finite automata (Q6487443) (← links)