Pages that link to "Item:Q5575575"
From MaRDI portal
The following pages link to Generalized Automata and Stochastic Languages (Q5575575):
Displayed 28 items.
- Reachability problems for Markov chains (Q477610) (← links)
- Unbounded-error quantum computation with small space bounds (Q550246) (← links)
- Theory of one-tape linear-time Turing machines (Q1041220) (← links)
- Probabilistic automata (Q1151262) (← links)
- On nonstochastic languages and homomorphic images of stochastic languages (Q1163382) (← links)
- Various kinds of automata with weights (Q1224551) (← links)
- Max-product grammars and languages (Q1229591) (← links)
- Stochastically costed tree automata: Turakainen's theorem (Q1351787) (← links)
- More on quantum, stochastic, and pseudo stochastic languages with few states (Q2003453) (← links)
- Improved constructions for succinct affine automata (Q2096598) (← links)
- Polynomially ambiguous probabilistic automata on restricted languages (Q2121470) (← links)
- Freeness properties of weighted and probabilistic automata over bounded languages (Q2280319) (← links)
- Determining the equivalence for one-way quantum finite automata (Q2518375) (← links)
- Counting with Probabilistic and Ultrametric Finite Automata (Q2944874) (← links)
- Ultrametric Algorithms and Automata (Q2945554) (← links)
- Homing vector automata (Q2969985) (← links)
- Languages Recognized with Unbounded Error by Quantum Finite Automata (Q3392970) (← links)
- The equivalence of deterministic gsm replications onQ-rational languages is decidable (Q3779775) (← links)
- The notion of a probabilistic cellular acceptor (Q3862454) (← links)
- (Q4988166) (← links)
- Decidability of Cutpoint Isolation for Probabilistic Finite Automata on Letter-Bounded Inputs. (Q5089287) (← links)
- Polynomially Ambiguous Probabilistic Automata on Restricted Languages (Q5091267) (← links)
- The minimal probabilistic and quantum finite automata recognizing uncountably many languages with fixed cutpoints (Q5130748) (← links)
- New Results on Vector and Homing Vector Automata (Q5207237) (← links)
- Propriétés booléennes des langages stochastiques (Q5678784) (← links)
- On the Computational Power of Affine Automata (Q5739014) (← links)
- Computational limitations of affine automata and generalized affine automata (Q6095491) (← links)
- Decision Questions for Probabilistic Automata on Small Alphabets (Q6137871) (← links)