Pages that link to "Item:Q4111486"
From MaRDI portal
The following pages link to Word-functions of stochastic and pseudo stochastic automata (Q4111486):
Displayed 6 items.
- On nonstochastic languages and homomorphic images of stochastic languages (Q1163382) (← links)
- Stochastically costed tree automata: Turakainen's theorem (Q1351787) (← links)
- More on quantum, stochastic, and pseudo stochastic languages with few states (Q2003453) (← links)
- Language Recognition Power and Succinctness of Affine Automata (Q2819147) (← links)
- The minimal probabilistic and quantum finite automata recognizing uncountably many languages with fixed cutpoints (Q5130748) (← links)
- Language recognition power and succinctness of affine automata (Q6061995) (← links)