Generalized Automata and Stochastic Languages
From MaRDI portal
Cited in
(33)- Languages Recognized with Unbounded Error by Quantum Finite Automata
- Skolem and positivity completeness of ergodic Markov chains
- On the computational power of affine automata
- Unbounded-error quantum computation with small space bounds
- Counting with probabilistic and ultrametric finite automata
- Ultrametric algorithms and automata
- The minimal probabilistic and quantum finite automata recognizing uncountably many languages with fixed cutpoints
- Large deviation properties for pattern statistics in primitive rational models
- New results on vector and homing vector automata
- More on quantum, stochastic, and pseudo stochastic languages with few states
- The notion of a probabilistic cellular acceptor
- Probabilistic automata
- Determining the equivalence for one-way quantum finite automata
- Freeness properties of weighted and probabilistic automata over bounded languages
- Decidability of Cutpoint Isolation for Probabilistic Finite Automata on Letter-Bounded Inputs.
- Homing vector automata
- Reachability problems for Markov chains
- One-way topological automata and the tantalizing effects of their topological features
- Ultrametric automata and Turing machines
- Computational limitations of affine automata and generalized affine automata
- The boundedness and zero isolation problems for weighted automata over nonnegative rationals
- The equivalence of deterministic gsm replications onQ-rational languages is decidable
- Stochastically costed tree automata: Turakainen's theorem
- Real-valued affine automata compute beyond Turing machines
- Analysis of the rate functions of large deviations for symbol statistics
- Polynomially Ambiguous Probabilistic Automata on Restricted Languages
- Theory of one-tape linear-time Turing machines
- On nonstochastic languages and homomorphic images of stochastic languages
- Propriétés booléennes des langages stochastiques
- Various kinds of automata with weights
- Max-product grammars and languages
- Improved constructions for succinct affine automata
- Polynomially ambiguous probabilistic automata on restricted languages
This page was built for publication: Generalized Automata and Stochastic Languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5575575)
