A note on two-way probabilistic automata
type: Item
instance of: scholarly article
title: A note on two-way probabilistic automata
zbMATH Open document ID: 0769.68068
DOI: 10.1016/0020-0190(92)90119-G
author: Jie Wang
published in: Information Processing Letters
publication date: 1992-12-06T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 69909
zbMATH Keywords: Markov chain
zbMATH Keywords: two-way probabilistic finite state automata
zbMATH Keywords: deterministic context-sensitive languages
MaRDI profile type: Publication
cites work: Matrix tree theorems
cites work: A Time Complexity Gap for Two-Way Probabilistic Finite-State Automata
cites work: Q3947125
cites work: A lower bound for probabilistic algorithms for finite state machines
cites work: Q3862379
cites work: Q4098444
cites work: Q4043014
cites work: Alternating Pushdown and Stack Automata
cites work: Estimating a probability using finite memory
cites work: Q5180413
cites work: Probabilistic automata
cites work: Q5553288
cites work: Q5569463
cites work: Q4039803
Wikidata QID: Q127310087
description: scientific article; zbMATH DE number 69909