Probabilistic length-reducing two-pushdown automata
type: Item
instance of: scholarly article
title: Probabilistic length-reducing two-pushdown automata
zbMATH Open document ID: 1178.68319
author: Tomasz Jurdziński
published in: Theory of Computing Systems
publication date: 2009-09-18T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68Q10
zbMATH DE Number: 5604816
zbMATH Keywords: Monte Carlo lrTPDA
MaRDI profile type: Publication
full work available at URL: s00224-007-9066-x
OpenAlex ID: W1979270933
cites work: Growing context-sensitive languages and Church-Rosser languages
cites work: Q4449165
cites work: On the power of Las Vegas II: Two-way finite automata
cites work: Membership for growing context-sensitive grammars is polynomial
cites work: Lower bound technique for length-reducing automata
cites work: Probabilistic Length-Reducing Automata
cites work: Properties of probabilistic pushdown automata
cites work: Q4941161
cites work: Church-Rosser Thue systems and formal languages
cites work: Q4737920
cites work: The Church-Rosser languages are the deterministic variants of the growing context-sensitive languages
cites work: Q4418659
DOI: 10.1007/S00224-007-9066-X
description: scientific article; zbMATH DE number 5604816