Generalized Automata and Stochastic Languages
From MaRDI portal
Publication:5575575
DOI10.2307/2036989zbMath0184.02802OpenAlexW4236196594MaRDI QIDQ5575575
Publication date: 1969
Full work available at URL: https://doi.org/10.2307/2036989
Related Items
Polynomially ambiguous probabilistic automata on restricted languages, Stochastically costed tree automata: Turakainen's theorem, Counting with Probabilistic and Ultrametric Finite Automata, Ultrametric Algorithms and Automata, Unnamed Item, Computational limitations of affine automata and generalized affine automata, Decision Questions for Probabilistic Automata on Small Alphabets, Probabilistic automata, The equivalence of deterministic gsm replications onQ-rational languages is decidable, Homing vector automata, Propriétés booléennes des langages stochastiques, On nonstochastic languages and homomorphic images of stochastic languages, Reachability problems for Markov chains, More on quantum, stochastic, and pseudo stochastic languages with few states, On the Computational Power of Affine Automata, Unbounded-error quantum computation with small space bounds, Various kinds of automata with weights, Max-product grammars and languages, The notion of a probabilistic cellular acceptor, Freeness properties of weighted and probabilistic automata over bounded languages, New Results on Vector and Homing Vector Automata, Determining the equivalence for one-way quantum finite automata, Decidability of Cutpoint Isolation for Probabilistic Finite Automata on Letter-Bounded Inputs., Languages Recognized with Unbounded Error by Quantum Finite Automata, Polynomially Ambiguous Probabilistic Automata on Restricted Languages, Theory of one-tape linear-time Turing machines, Improved constructions for succinct affine automata, The minimal probabilistic and quantum finite automata recognizing uncountably many languages with fixed cutpoints
Cites Work
