Publication:5643915
From MaRDI portal
zbMath0234.94055MaRDI QIDQ5643915
Publication date: 1971
68-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science
68Q45: Formal languages and automata
Related Items
On probabilistic analog automata, Automata theory based on quantum logic: Some characterizations, Multihead two-way probabilistic finite automata, On the maximum of ergodicity coefficients, the Dobrushin ergodicity coefficient, and products of stochastic matrices, Weak minimization of DFA -- an algorithm and applications, A survey of solution techniques for the partially observed Markov decision process, Decidability of finite probabilistic propositional dynamic logics, On the undecidability of probabilistic planning and related stochastic optimization problems, The equivalence between fuzzy Mealy and fuzzy Moore machines, On almost scrambling stochastic matrices, A note on semigroups of regular stochastic matrices, Computation of distances for regular and context-free probabilistic languages, Computation in finitary stochastic and quantum processes, Conditions for weak ergodicity of inhomogeneous Markov chains, Interacting with an artificial partner: modeling the role of emotional aspects, Coefficients of ergodicity and the scrambling index, The decomposition of stochastic systems, Multiaction learning automata possessing ergodicity of the mean, Some deterministic models of concept identification, Explicit forms for ergodicity coefficients and spectrum localization, Stochastic automata with large state spaces and low rank, Homogeneous decomposition of stochastic systems, Probabilistic Ianov's schemes, Construction of a conditional probability learning model and information theoretical evaluation of its efficiency, CPO's of measures for nondeterminism, Stochastic combinational networks, Automata theory, Absolute expediency of learning automata, Probabilistic automata, The rate of convergence for backwards products of a convergent sequence of finite Markov matrices, The nature of Soviet mathematical psychology, Semantics of probabilistic programs, Equivalence, reduction and minimization of finite fuzzy-automata, On nonstochastic languages and homomorphic images of stochastic languages, Sets of nonnegative matrices with positive inhomogeneous products, Non-stationary inventory position processes, Equivalence, reduction and minimization of finite automata over semirings, Sets of matrices all infinite products of which converge, Ergodicity for products of infinite stochastic matrices, 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, Classes of formal grammars, Closure properties and languages defined by bilinear automata, Consolidation and decomposition of homogeneous Markov processes, The complexity of the max word problem and the power of one-way interactive proof systems, Results on limiting sets of Markov set chains, Analysis, classification, and coding of multielectrode spike trains with hidden Markov models, On path equivalence of nondeterministic finite automata, Computing the observed information in the hidden Markov model using the EM algorithm, Applications of Paz's inequality to perturbation bounds for Markov chains, Positive tree representations and applications to tree automata, Automaton models of performance, Note on analogue memory automata, On the simulation of quantum Turing machines., Characterizations of fuzzy finite automata., Finite \(L\)-fuzzy machines., Improved bounds for a condition number for Markov chains, Quantum automata and quantum grammars, Stochastic analog networks and computational complexity, The boundedness of all products of a pair of matrices is undecidable, A probabilistic model of computing with words, A probabilistic approach to navigation in Hypertext, Cyclic decomposition of finite stochastic systems, Regular languages accepted by quantum automata, On the continuous dependence between a matrix product and its factors for finite systems of stochastic and substochastic matrices, On the weak ergodicity of nonhomogeneous Markov chains, Similitudes and the \(\ell_ 1\)-norm, New results on the common consequent index of a binary relation, Equivalence in automata theory based on complete residuated lattice-valued logic, Quantum automata and algebraic groups, WCET free time analysis of hard real-time systems on multiprocessors: A regular language-based model, Strong stability and perturbation bounds for discrete Markov chains, Small size quantum automata recognizing some regular languages, Links between probabilistic automata and hidden Markov models: probability distributions, learning models and induction algorithms, Determination of equivalence between quantum sequential machines, Determining the equivalence for one-way quantum finite automata, State estimation and detectability of probabilistic discrete event systems, Finite stochastic automata with variable transition probabilities, Probabilistic temporal logics via the modal mu-calculus, Concise representations of regular languages by degree and probabilistic finite automata, Note on the Succinctness of Deterministic, Nondeterministic, Probabilistic and Quantum Finite Automata, Stochastic Decision Theory, Probabilistic models for pattern statistics, Average Value and Variance of Pattern Statistics in Rational Models, Unnamed Item, Unnamed Item, Unnamed Item, Rank and statistical mapping of a strongly connected automaton, Unnamed Item, The notion of a probabilistic cellular acceptor, Quasifiniteness of a set of stochastic matrices, BARYCENTRIC ENTROPY OF MARKOV SYSTEMS, On products of non-negative matrices, On a bound on algebraic connectivity: the case of equality, Probabilistic asynchronous automata, On Decision Problems for Probabilistic Büchi Automata, Unnamed Item, A probabilistic model of learning by means of problems, On ergodicity coefficients of infinite stochastic matrices, On graphs with equal algebraic and vertex connectivity, Analogies and differences between quantum and stochastic automata, Unnamed Item, Unnamed Item, The rate of convergence of certain nonhomogeneous Markov chains, Deterministic representation of probabilistic systems by ergodic machines, Representation of a word function as the sum of two functions, Unnamed Item
