Probabilistic automata
From MaRDI portal
Publication:5572344
DOI10.1016/S0019-9958(63)90290-0zbMath0182.33602OpenAlexW4212875940WikidataQ57382572 ScholiaQ57382572MaRDI QIDQ5572344
Publication date: 1963
Published in: Information and Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0019-9958(63)90290-0
Related Items (only showing first 100 items - show all)
Randomized algorithms in combinatorial optimization: A survey ⋮ Polynomially ambiguous probabilistic automata on restricted languages ⋮ What is decidable about partially observable Markov decision processes with \(\omega\)-regular objectives ⋮ On the effects of noise and speed on computations ⋮ Compositional strategy synthesis for stochastic games with multiple objectives ⋮ Lower bounds for one-way probabilistic communication complexity and their application to space complexity ⋮ The statistics of state-spaces ⋮ The complexity properties of probabilistic automata with isolated cut point ⋮ Quantitative verification and strategy synthesis for stochastic games ⋮ A nonlinear public key cryptosystem ⋮ Affine automata verifiers ⋮ On the continuous dependence between a matrix product and its factors for finite systems of stochastic and substochastic matrices ⋮ Stamina: stabilisation monoids in automata theory ⋮ On probabilistic analog automata ⋮ Automata theory based on quantum logic: Some characterizations ⋮ A randomized algorithm for checking equivalence of circular lists ⋮ Calibrating generative models: the probabilistic Chomsky-Schützenberger hierarchy ⋮ On some variations of two-way probabilistic finite automata models ⋮ A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences ⋮ Composition and behaviors of probabilistic I/O automata ⋮ Automaton models of performance ⋮ Size lower bounds for quantum automata ⋮ Fast probabilistic algorithms for Hamiltonian circuits and matchings ⋮ Learning deterministic probabilistic automata from a model checking perspective ⋮ On the simulation of quantum Turing machines. ⋮ On probabilistic and quantum reaction systems ⋮ Recurrence and transience for finite probabilistic tables ⋮ Probabilistic automata ⋮ Ambiguity, weakness, and regularity in probabilistic Büchi automata ⋮ The compositional construction of Markov processes ⋮ Probabilistic grammars and languages ⋮ Consistency and refinement for interval Markov chains ⋮ Symmetry breaking in distributed networks ⋮ Probabilistic opacity for Markov decision processes ⋮ Projections of languages recognizable by probabilistic and alternating finite multitape automata ⋮ Quantum inductive inference by finite automata ⋮ Introducing synchrony in fuzzy automata ⋮ Exponentially more concise quantum recognition of non-RMM regular languages ⋮ Reachability problems for Markov chains ⋮ Computation in finitary stochastic and quantum processes ⋮ Automata theory based on quantum logic: reversibilities and pushdown automata ⋮ Constructive logical characterizations of bisimilarity for reactive probabilistic systems ⋮ Quantum automata and algebraic groups ⋮ Uniform and Bernoulli measures on the boundary of trace monoids ⋮ Decidable and expressive classes of probabilistic automata ⋮ The complexity of synchronizing Markov decision processes ⋮ Quantum automata for some multiperiodic languages ⋮ ptype: probabilistic type inference ⋮ A note on two-way probabilistic automata ⋮ True-concurrency probabilistic models: Markov nets and a law of large numbers ⋮ Algorithmic probabilistic game semantics. Playing games with automata ⋮ On the complexity of minimizing probabilistic and quantum automata ⋮ Profinite techniques for probabilistic automata and the Markov monoid algorithm ⋮ More concise representation of regular languages by automata and regular expressions ⋮ Quantitative Kleene coalgebras ⋮ More on quantum, stochastic, and pseudo stochastic languages with few states ⋮ Revisiting bisimilarity and its modal logic for nondeterministic and probabilistic processes ⋮ Small size quantum automata recognizing some regular languages ⋮ On metrics for probabilistic systems: definitions and algorithms ⋮ Grammatiche context-free su spazi metrici compatti ⋮ Unbounded-error quantum computation with small space bounds ⋮ Some formal tools for analyzing quantum automata. ⋮ On partially blind multihead finite automata. ⋮ Realizations of fuzzy languages by probabilistic, max-product, and maximin automata ⋮ A probabilistic model of computing with words ⋮ A lower bound for probabilistic algorithms for finite state machines ⋮ The quest for minimal quotients for probabilistic and Markov automata ⋮ Probabilistic models of computer deadlock ⋮ Capacitated automata and systems ⋮ On Markov chains generated by Markovian controlled Markov systems. I: Ergodic properties ⋮ Interacting with an artificial partner: modeling the role of emotional aspects ⋮ Classes of formal grammars ⋮ Determining the equivalence for one-way quantum finite automata ⋮ State estimation and detectability of probabilistic discrete event systems ⋮ Automata theory and control theory - a rapprochement ⋮ On a class of languages recognizable by probabilistic reversible decide-and-halt automata ⋮ Closure properties of the classes of sets recognized by space-bounded two-dimensional probabilistic Turing machines ⋮ A note on two-dimensional probabilistic Turing machines ⋮ A probabilistic approach to navigation in Hypertext ⋮ Probabilistic automata of bounded ambiguity ⋮ A note on quantum sequential machines ⋮ Characterizations of one-way general quantum finite automata ⋮ Quantum automata and quantum grammars ⋮ Multi-letter quantum finite automata: decidability of the equivalence and minimization of states ⋮ Stabilization of probabilistic finite automata based on semi-tensor product of matrices ⋮ Theory of one-tape linear-time Turing machines ⋮ The time-precision tradeoff problem on on-line probabilistic Turing machines ⋮ A note on two-dimensional probabilistic finite automata ⋮ A general definition of stochastic automata ⋮ Image-binary automata ⋮ Improved constructions for succinct affine automata ⋮ Bounds for synchronizing Markov decision processes ⋮ POMDPs under probabilistic semantics ⋮ Probabilistic Turing machines and recursively enumerable Dedekind cuts ⋮ The complexity of the max word problem and the power of one-way interactive proof systems ⋮ Testing preorders for probabilistic processes can be characterized by simulations ⋮ Optimal cost almost-sure reachability in POMDPs ⋮ Computation with multiple CTCs of fixed length and width ⋮ On the undecidability of probabilistic planning and related stochastic optimization problems ⋮ On measure quantifiers in first-order arithmetic
This page was built for publication: Probabilistic automata
