Pages that link to "Item:Q6487443"
From MaRDI portal
The following pages link to The complexity of probabilistic versus deterministic finite automata (Q6487443):
Displaying 16 items.
- A lower bound for probabilistic algorithms for finite state machines (Q579936) (← links)
- On the complexity of minimizing probabilistic and quantum automata (Q690502) (← links)
- The complexity properties of probabilistic automata with isolated cut point (Q1102752) (← links)
- On the computational complexity of approximating distributions by probabilistic automata (Q1207305) (← links)
- Improved constructions for succinct affine automata (Q2096598) (← links)
- Probabilistic Automata with Isolated Cut-Points (Q2849915) (← links)
- Complexity of Promise Problems on Classical and Quantum Automata (Q2944886) (← links)
- Note on the complexity of Las Vegas automata problems (Q3421911) (← links)
- Efficient Computation of the Relative Entropy of Probabilistic Automata (Q3525770) (← links)
- (Q3970814) (← links)
- (Q3975178) (← links)
- On comparative complexity of probabilistic and deterministic automata (Q3979858) (← links)
- Lower Bounds for Las Vegas Automata by Information Theory (Q4462677) (← links)
- Lower bounds for the state complexity of probabilistic languages and the language of prime numbers (Q5108020) (← links)
- Artin’s Conjecture and Size of Finite Probabilistic Automata (Q5452183) (← links)
- Probabilism versus Alternation for Automata (Q6163621) (← links)