scientific article; zbMATH DE number 3371972
From MaRDI portal
Publication:5643915
zbMath0234.94055MaRDI QIDQ5643915
Publication date: 1971
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Formal languages and automata (68Q45)
Related Items (only showing first 100 items - show all)
Explicit forms for ergodicity coefficients and spectrum localization ⋮ What is decidable about partially observable Markov decision processes with \(\omega\)-regular objectives ⋮ Ergodicity of non-homogeneous \(\mathbf{p}\)-majorizing quadratic stochastic operators ⋮ Stochastic automata with large state spaces and low rank ⋮ Homogeneous decomposition of stochastic systems ⋮ Analysis, classification, and coding of multielectrode spike trains with hidden Markov models ⋮ Reachability analysis of quantum Markov decision processes ⋮ Probabilistic Ianov's schemes ⋮ Predictive rate-distortion for infinite-order Markov processes ⋮ Approximation of fuzzy context-free grammars ⋮ On path equivalence of nondeterministic finite automata ⋮ Maps preserving matrices of extremal scrambling index ⋮ Computing the observed information in the hidden Markov model using the EM algorithm ⋮ The equivalence between fuzzy Mealy and fuzzy Moore machines ⋮ On probabilistic analog automata ⋮ Applications of Paz's inequality to perturbation bounds for Markov chains ⋮ Automata theory based on quantum logic: Some characterizations ⋮ Positive tree representations and applications to tree automata ⋮ Construction of a conditional probability learning model and information theoretical evaluation of its efficiency ⋮ State succinctness of two-way finite automata with quantum and classical states ⋮ Automaton models of performance ⋮ Note on analogue memory automata ⋮ CPO's of measures for nondeterminism ⋮ Computational mechanics of input-output processes: structured transformations and the \(\epsilon\)-transducer ⋮ Stochastic combinational networks ⋮ Automata theory ⋮ Absolute expediency of learning automata ⋮ On the simulation of quantum Turing machines. ⋮ On probabilistic and quantum reaction systems ⋮ Recurrence and transience for finite probabilistic tables ⋮ Probabilistic automata ⋮ The rate of convergence for backwards products of a convergent sequence of finite Markov matrices ⋮ A theory of computation based on unsharp quantum logic: finite state automata and pushdown automata ⋮ Minimization of probabilistic models of programs ⋮ The nature of Soviet mathematical psychology ⋮ Lifespan in a primitive Boolean linear dynamical system ⋮ Generalization bounds for learning weighted automata ⋮ On almost scrambling stochastic matrices ⋮ Analogues of quantum complementarity in the theory of automata ⋮ Semantics of probabilistic programs ⋮ Equivalence, reduction and minimization of finite fuzzy-automata ⋮ On nonstochastic languages and homomorphic images of stochastic languages ⋮ Probabilistic opacity for Markov decision processes ⋮ Characterizations of fuzzy finite automata. ⋮ Finite \(L\)-fuzzy machines. ⋮ A note on semigroups of regular stochastic matrices ⋮ Sets of nonnegative matrices with positive inhomogeneous products ⋮ A new family of nonstochastic languages ⋮ Non-stationary inventory position processes ⋮ Exponentially more concise quantum recognition of non-RMM regular languages ⋮ Exact synchronization for finite-state sources ⋮ Improved bounds for a condition number for Markov chains ⋮ Computation of distances for regular and context-free probabilistic languages ⋮ Equivalence, reduction and minimization of finite automata over semirings ⋮ \textsc{PAutomaC}: a probabilistic automata and hidden Markov models learning competition ⋮ Computation in finitary stochastic and quantum processes ⋮ Sets of matrices all infinite products of which converge ⋮ Quantum Markov chains: description of hybrid systems, decidability of equivalence, and model checking linear-time properties ⋮ Multihead two-way probabilistic finite automata ⋮ On the maximum of ergodicity coefficients, the Dobrushin ergodicity coefficient, and products of stochastic matrices ⋮ Promise problems solved by quantum and classical finite automata ⋮ Conditions for weak ergodicity of inhomogeneous Markov chains ⋮ On the complexity of minimizing probabilistic and quantum automata ⋮ Profinite techniques for probabilistic automata and the Markov monoid algorithm ⋮ Ergodicity for products of infinite stochastic matrices ⋮ Weak minimization of DFA -- an algorithm and applications ⋮ Unbounded-error quantum computation with small space bounds ⋮ Word functions of pseudo -Markov chains ⋮ Two theorems generalizing the mean transition probability results in the theory of Markov chains ⋮ Various kinds of automata with weights ⋮ Stochastic automaton models for the temporal pattern discrimination of nerve impulse sequences ⋮ Probabilistic models of computer deadlock ⋮ On some questions of rationality and decidability ⋮ On Markov chains generated by Markovian controlled Markov systems. I: Ergodic properties ⋮ The convergence of Cesaro averages for certain nonstationary Markov chains ⋮ Exponential convergence of products of stochastic matrices ⋮ Interacting with an artificial partner: modeling the role of emotional aspects ⋮ Classes of formal grammars ⋮ Coefficients of ergodicity and the scrambling index ⋮ Closure properties and languages defined by bilinear automata ⋮ Consolidation and decomposition of homogeneous Markov processes ⋮ Inequality of finite behaviors of rational weight finite automata is in R ⋮ 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 ⋮ Pumping Lemma in context-free grammar theory based on complete residuated lattice-valued logic ⋮ The case of equality in the Dobrushin-Deutsch-Zenger bound ⋮ Stochastic analog networks and computational complexity ⋮ Identifiability of parameters in latent structure models with many observed variables ⋮ The boundedness of all products of a pair of matrices is undecidable ⋮ The decomposition of stochastic systems ⋮ The complexity of the max word problem and the power of one-way interactive proof systems ⋮ A survey of solution techniques for the partially observed Markov decision process ⋮ Results on limiting sets of Markov set chains ⋮ Multiaction learning automata possessing ergodicity of the mean ⋮ Decidability of finite probabilistic propositional dynamic logics ⋮ Optimal cost almost-sure reachability in POMDPs ⋮ On the undecidability of probabilistic planning and related stochastic optimization problems ⋮ Some deterministic models of concept identification
This page was built for publication:
