Pages that link to "Item:Q4560366"
From MaRDI portal
The following pages link to Complexity of probabilistic versus deterministic automata (Q4560366):
Displaying 6 items.
- A new family of nonstochastic languages (Q656590) (← links)
- Decreasing the bandwidth of a transition matrix (Q673904) (← links)
- Multihead two-way probabilistic finite automata (Q675857) (← links)
- Multiple Usage of Random Bits in Finite Automata (Q2898066) (← links)
- Ultrametric Algorithms and Automata (Q2945554) (← links)
- Multihead two-way probabilistic finite automata (Q5096345) (← links)
