No label defined (Q3753494)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3990877
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3990877 |
Statements
1985
0 references
decidability
0 references
probabilistic automaton
0 references
stochastic matrices
0 references
equivalence
0 references
communication channels
0 references
minimization
0 references
homomorphism
0 references
families of languages
0 references
reduction
0 references
identifiability
0 references
sequences of pairs of random codes
0 references
structure theory
0 references
computational power
0 references
0.7990501523017883
0 references
0.7990501523017883
0 references
0.7921862602233887
0 references
This monograph can be viewed as a textbook for postgraduate students in computer science. It provides both, an overview concerning the investigations in probabilistic automata theory and a motivation for further research in this area. The book covers the main results obtained in 489 papers (233 published in Russian and 252 published in English or German) in a concise form. The proofs of the presented results are included in a well-readable form, the main ideas are conveniently emphasized. The book is divided into 6 sections. The first one involves the basic definitions concerning the probabilistic automaton model, the basic properties of stochastic matrices and the study of the initial equivalence of probabilistic automata. The relation between communication channels and probabilistic automata (PA), the equivalence of PA, the minimization technique for PA, and the homomorphism between PA are considered in Section 2. The algebraic properties of the families of languages defined by PA are presented in Section 3. The results concerning the reduction and identifiability problems for PA, the relation between sequences of pairs of random codes and PA, and some further special questions are studied in Section 4. The structure theory of PA is included in Section 5. Section 6 is devoted to the comparison of the computational power of probabilistic and deterministic computations.
0 references