On probabilistic analog automata

DOI10.1016/j.tcs.2004.03.003zbMath1068.68074OpenAlexW2159449605WikidataQ58455275 ScholiaQ58455275MaRDI QIDQ596111

Hava T. Siegelmann, Alexander Roitershtein, Asa Ben-Hur

Publication date: 10 August 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2004.03.003

zbMATH Keywords

systemsMarkov operatorsRegular languagesDefinite languagesNoisy computationalProbabilistic automataProbabilistic computation

Mathematics Subject Classification ID

Discrete-time Markov processes on general state spaces (60J05) Formal languages and automata (68Q45) Dynamical aspects of cellular automata (37B15)

Cites Work

• Markov chains and stochastic stability
• On the computational power of neural nets
• Transformations on sequence spaces
• Automata Studies. (AM-34)
• The Theory of Definite Automata
• Probabilistic automata
• Ergodic Theorems for Infinite Probabilistic Tables
• On Two Recent Papers on Ergodicity in Nonhomogeneous Markov Chains
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item