On stochastic languages

DOI10.1016/S0019-9958(68)90360-4MaRDI QIDQ5616149zbMATH OpenOpenAlexFDO

Authors Paavo Turakainen

Publication date 1968

Published in Information and Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0019-9958(68)90360-4

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited in

(16)

• On a class of languages recognizable by probabilistic reversible decide-and-halt automata
• Theory of one-tape linear-time Turing machines
• Probabilistic automata
• On nonstochastic languages and homomorphic images of stochastic languages
• Decidability of Skolem matrix emptiness problem entails constructability of exact regular expression
• Quantum automata and quantum grammars
• Theory of formal grammars
• More on quantum, stochastic, and pseudo stochastic languages with few states
• Conversion based fuzzy fractal dimension integrating self-similarity and porosity, via DFS and FIS (Mamdani and Sugeno systems)
• On stochastic context-free languages
• The Genesis of Fuzzy Sets and Systems – Aspects in Science and Philosophy
• Quantum automata theory -- a review
• The notion of a probabilistic cellular acceptor
• Stochastic grammars and languages
• New results on vector and homing vector automata
• Approximate verification of the symbolic dynamics of Markov chains

This page was built for publication: On stochastic languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5616149)