On probabilistic analog automata
DOI10.1016/J.TCS.2004.03.003zbMATH Open1068.68074OpenAlexW2159449605WikidataQ58455275 ScholiaQ58455275MaRDI QIDQ596111FDOQ596111
Authors: Asa Ben-Hur, Alexander Roitershtein, Hava T. Siegelmann
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
Recommendations
systemsMarkov operatorsDefinite languagesNoisy computationalProbabilistic automataProbabilistic computationRegular languages
Formal languages and automata (68Q45) Discrete-time Markov processes on general state spaces (60J05) Dynamical aspects of cellular automata (37B15)
Cites Work
- Markov chains and stochastic stability
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Probabilistic automata
- Title not available (Why is that?)
- Title not available (Why is that?)
- Ergodic Theorems for Infinite Probabilistic Tables
- Title not available (Why is that?)
- On Two Recent Papers on Ergodicity in Nonhomogeneous Markov Chains
- On the computational power of neural nets
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Automata Studies. (AM-34)
- Title not available (Why is that?)
- Transformations on sequence spaces
- Title not available (Why is that?)
- The Theory of Definite Automata
Cited In (8)
- Title not available (Why is that?)
- Probabilistic automata and processors (Significance, some methodologies and results)
- Title not available (Why is that?)
- Probabilistic automata for computing with words
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication: On probabilistic analog automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q596111)