Probabilistic automata
From MaRDI portal
Publication:1151262
DOI10.1007/BF01088986zbMath0457.68045OpenAlexW4210960585MaRDI QIDQ1151262
Publication date: 1980
Published in: Journal of Soviet Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01088986
surveyequivalencerandom mediahomomorphismsstochastic automatastructure theorylexicographic functionsrepresentation of languages
Formal languages and automata (68Q45) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Algorithms in computer science (68W99)
Related Items (4)
Polynomially ambiguous probabilistic automata on restricted languages ⋮ Finite-Memory Strategies in POMDPs with Long-Run Average Objectives ⋮ Partial-Observation Stochastic Games ⋮ Polynomially Ambiguous Probabilistic Automata on Restricted Languages
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Probabilistic automata and stochastic transformations
- SCHWACHE HOMOMORPHISMEN FÜR STOCHASTISCHE AUTOMATEN
- Synchronizing Sequences for Probabilistic Automata
- The Decision Problems of Definite Stochastic Automata
- Representability of nonregular languages in finite probabilistic automata
- Some algebraic properties of sets of stochastic matrices
- Regular Events in Stochastic Sequential Machines
- Fuzzy algorithms
- On m-adic stochastic languages
- Two-state two-symbol probabilistic automata
- Stochastic Automata Games
- Gekoppelte stochastische Automaten und sequentielle Zwei-Personen-Spiele
- On stochastic languages
- A context-free language which is not acceptable by a probabilistic automaton
- Some closure properties of the family of stochastic languages
- Realization of Stochastic Automata
- A Realizable Model for Stochastic Sequential Machines
- On the loop-free decomposition of stochastic finite-state systems
- Convex stochastic sequential machines
- Probabilistic tree automata
- A Note on the Linear Reinforcement Scheme for Variable-Structure Stochastic Automata
- First and second covering problems of quasi stochastic systems
- Stochastic Automata and the Problems of Reliability in Sequential Machines
- Computational Complexity and Probability Constructions
- Probabilistic Automata with Monitored Final State Sets
- Whirl Decomposition of Stochastic Systems
- Some aspects of linear space automata
- The Search for a Definition of Partition Pair for Stochastic Automata
- Identification of stochastic finite-state systems
- On a Class of Stochastic Languages
- Probabilistic grammars and automata
- On languages defined by linear probabilistic automata
- Computability by Probabilistic Turing Machines
- On asynchronous stochastic automata
- Stochastic Automata Models with Applications to Learning Systems
- Polymatrix Games with Joint Constraints
- Analysis and Synthesis of Stable Linear Sequential Circuits
- On two-state isolated probabilistic automata
- Absolutely Expedient Learning Algorithms for Stochastic Automata
- On multistochastic automata
- Probabilistic automata—a problem of Paz
- Finite-state probabilistic languages
- Linear Stochastic Operators
- On the Identifiability Problem for Functions of Finite Markov Chains
- On the Identifiability Problem for Functions of Finite Markov Chains
- Iterative decomposition of finite probabilistic automata
- Realizations of fuzzy languages by probabilistic, max-product, and maximin automata
- Random environments and automata
- Decompositions of linear sequential circuits over residue class rings
- Reduced forms for stochastic sequential machines
- A general definition of stochastic automata
- Eigenschaften der von linearen Automaten erkennbaren Worte
- Block-statistic matrices and associated finite-state languages
- Synthesis of probability transformers
- Probabilistic tree automata and context free languages
- Diagnostische Vorgabeexperimente mit stochastischen Automaten. (Diagnosing preset experiments with stochastic automata)
- Realizations by stochastic finite automata
- Finite stochastic automata with variable transition probabilities
- Penny matching machines
- A Finite Criterion for Indecomposable Channels
- A note on probabilistic input\3-output relations
- Some remarks on multistochastic automata
- Games of Stochastic Automata
- A note on probabilistic grammars
- Linear Automata Approximation Problem
- On the size of the set of all reducible stochastic sequential machines
- The dimension of stability of stochastic automata
- A Geometric Model for Stochastic Automata
- Functions associated to a partition on state set of a probabilistic automaton
- [Russian Text Ignored]
- Computational Complexity of Probabilistic Turing Machines
- State estimation algorithms for non-linear stochastic sequential machines
- Two ε-Optimal Nonlinear Reinforcement Schemes for Stochastic Automata
- On the synthesis of generators of stable probability distributions
- Learning Automata - A Survey
- A Note on the Learning Behavior of Variable-Structure Stochastic Automata
- Minimization of Linear Sequential Machines
- State-Splitting for Stochastic Machines
- The decomposition of stochastic automata
- Finite abstract random automata
- Markov Chains as Random Input Automata
- Fuzzy sets
- On a Weight Distribution Problem, with Application to the Design of Stochastic Generators
- Comments on the Minimization of Stochastic Machines
- Realization of Stochastic Systems
- Definite and Quasidefinite Sets of Stochastic Matrices
- Some aspects of probabilistic automata
- Equivalences between probabilistic and deterministic sequential machines
- Minimization theorems and techniques for sequential stochastic machines
- Threshold Logic Elements Used as a Probability Transformer
- A Mathematical Model of Finite Random Sequential Automata
- A Finite Set of $n \times n$ Stochastic Matrices Generating all n-Dimensional Probability Vectors Whose Coordinates Have Finite Binary Expansion
- On m-adic probabilistic automata
- On the external probability structure of finite-state channels
- On Events Represented by Probabilistic Automata of Different Types
- The unsolvability of the Equivalence Problem for Λ-Free nondeterministic generalized machines
- Fuzzy events realized by finite probabilistic automata
- On codification in finite abstract random automata
- Stochastische Ereignisse und Wortmengen
- Zur Theorie abstrakter stochastischer Automaten
- Homomorphisms between stochastic sequential machines and related problems
- A Theorem on the State Reduction of Synthesized Stochastic Machines
- Stochastic sequential machines with prescribed performance criteria
- A note on definite stochastic sequential machines
- Fuzzy algorithms
- Probabilistic automata
- Generalized Automata and Stochastic Languages
- Use of Stochastic Automata for Parameter Self-Optimization with Multimodal Performance Criteria
- Probabilistic Turing Machines and Computability
- Probabilistic and weighted grammars
- Continuous-time probabilistic automata
- Strong stability problems for probabilistic sequential machines
- Linear probabilistic sequential machines
- A Formulation of Fuzzy Automata and Its Application as a Model of Learning Systems
This page was built for publication: Probabilistic automata
