On probabilistic analog automata
type: Item
instance of: scholarly article
title: On probabilistic analog automata
zbMATH Open document ID: 1068.68074
author: Asa Ben-Hur
author: Alexander Roitershtein
author: Hava T. Siegelmann
published in: Theoretical Computer Science
publication date: 2004-08-10T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 37B15
Mathematics Subject Classification ID: 60J05
zbMATH DE Number: 2085518
zbMATH Keywords: Probabilistic automata
zbMATH Keywords: Probabilistic computation
zbMATH Keywords: Noisy computational
zbMATH Keywords: systems
zbMATH Keywords: Regular languages
zbMATH Keywords: Definite languages
zbMATH Keywords: Markov operators
MaRDI profile type: Publication
Wikidata QID: Q58455275
full work available at URL: j.tcs.2004.03.003
OpenAlex ID: W2159449605
cites work: Q3883053
cites work: Transformations on sequence spaces
cites work: Q5822308
cites work: Q5654646
cites work: On Two Recent Papers on Ergodicity in Nonhomogeneous Markov Chains
cites work: Q3995207
cites work: Q5590550
cites work: Q3147647
cites work: Q4323294
cites work: Automata Studies. (AM-34)
cites work: Markov chains and stochastic stability
cites work: Q5509984
cites work: Q4048325
cites work: Ergodic Theorems for Infinite Probabilistic Tables
cites work: Q5643915
cites work: The Theory of Definite Automata
cites work: Probabilistic automata
cites work: Q5541339
cites work: Q4231133
cites work: On the computational power of neural nets
DOI: 10.1016/J.TCS.2004.03.003
description: scientific article; zbMATH DE number 2085518