Word-functions of stochastic and pseudo stochastic automata

DOI10.5186/AASFM.1975.0126zbMath0343.94027OpenAlexW2325996936MaRDI QIDQ4111486

Paavo Turakainenn

Publication date: 1975

Published in: Annales Academiae Scientiarum Fennicae Series A I Mathematica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.5186/aasfm.1975.0126

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (6)

Stochastically costed tree automata: Turakainen's theorem ⋮ Language recognition power and succinctness of affine automata ⋮ On nonstochastic languages and homomorphic images of stochastic languages ⋮ More on quantum, stochastic, and pseudo stochastic languages with few states ⋮ Language Recognition Power and Succinctness of Affine Automata ⋮ The minimal probabilistic and quantum finite automata recognizing uncountably many languages with fixed cutpoints

This page was built for publication: Word-functions of stochastic and pseudo stochastic automata