Word-functions of stochastic and pseudo stochastic automata
From MaRDI portal
Publication:4111486
DOI10.5186/aasfm.1975.0126zbMath0343.94027MaRDI QIDQ4111486
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
68Q45: Formal languages and automata
Related Items
The minimal probabilistic and quantum finite automata recognizing uncountably many languages with fixed cutpoints, On nonstochastic languages and homomorphic images of stochastic languages, Stochastically costed tree automata: Turakainen's theorem, More on quantum, stochastic, and pseudo stochastic languages with few states, Language Recognition Power and Succinctness of Affine Automata