On some variations of two-way probabilistic finite automata models
type: Item
instance of: scholarly article
title: On some variations of two-way probabilistic finite automata models
zbMATH Open document ID: 1111.68063
published in: Theoretical Computer Science
publication date: 2007-05-11T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 5151703
zbMATH Keywords: probabilistic finite automaton
zbMATH Keywords: counter machine
zbMATH Keywords: pebble automaton
author: B. Ravikumar
MaRDI profile type: Publication
full work available at URL: j.tcs.2007.01.017
OpenAlex ID: W1972193441
cites work: Shuffling Cards and Stopping Times
cites work: Q4144808
cites work: Parallel computation for well-endowed rings and space-bounded probabilistic machines
cites work: On the Power of Finite Automata with both Nondeterministic and Probabilistic States
cites work: Q3204032
cites work: A Time Complexity Gap for Two-Way Probabilistic Finite-State Automata
cites work: Finite state verifiers I
cites work: Q5538132
cites work: Q3947125
cites work: The knowledge complexity of interactive proof-systems
cites work: A lower bound for probabilistic algorithms for finite state machines
cites work: Q3862379
cites work: Sublogarithmic-space turing machines, nonuniform space complexity, and closure properties
cites work: There is no polynomial deterministic space simulation of probabilistic space with a two-way random-tape generator
cites work: On the power of two-way random generators and the impossibility of deterministic poly-space simulation
cites work: Q4266534
cites work: Probabilistic automata
cites work: Q4256643
DOI: 10.1016/J.TCS.2007.01.017
Recommended article: On Some Variations of Two-Way Probabilistic Finite Automata Models
Recommended article: Q4256643
Recommended article: Q3319779
Recommended article: A note on two-way probabilistic automata
Recommended article: A note on two-dimensional probabilistic finite automata
Recommended article: Q5186739
Recommended article: Multihead two-way probabilistic finite automata
Recommended article: Q4737212
Recommended article: Stochasticity of the languages acceptable by two-way finite probabilistic automata
description: scientific article; zbMATH DE number 5151703