scientific article; zbMATH DE number 3990877
communication channelscomputational powerdecidabilityequivalencefamilies of languageshomomorphismidentifiabilityminimizationprobabilistic automatonreductionsequences of pairs of random codesstochastic matricesstructure theory
Semigroups in automata theory, linguistics, etc. (20M35) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Channel models (including quantum) in information and communication theory (94A40)
- Finitely nonstationary nondeterministic automata with random input
- Probabilistic automata and processors (Significance, some methodologies and results)
- Algebraic properties of probabilistic finite automata
- scientific article; zbMATH DE number 1972786 (Why is no real title available?)
- Finite-state automata in information technologies
- Multi-parametric classification of automaton Markov models based on the sequences they generate
- On multivalued transformations of finite sets of binary distributions with rational probabilities
- On probabilistic analog automata
- Stochastic matrices and the assessment of the vulnerability of automated systems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3753494)
