A note on two-way nondeterministic pushdown automata
type: Item
instance of: scholarly article
title: A note on two-way nondeterministic pushdown automata
zbMATH Open document ID: 0496.68035
DOI: 10.1016/0020-0190(82)90075-8
author: Wojciech Rytter
published in: Information Processing Letters
publication date: 1982-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q05
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 3782387
zbMATH Keywords: time complexity
zbMATH Keywords: stack bounded
zbMATH Keywords: reversal bounded
zbMATH Keywords: one-turn
zbMATH Keywords: random access machine
zbMATH Keywords: complexity of the simulation of pushdown automata
MaRDI profile type: Publication
full work available at URL: 0020-0190(82)90075-8
OpenAlex ID: W2073767883
cites work: Time and tape complexity of pushdown automaton languages
cites work: On the Asymptotic Complexity of Matrix Multiplication
cites work: Q4198075
cites work: Time complexity of languages recognized by one-way multihead pushdown automata
cites work: General context-free recognition in less than cubic time
description: scientific article; zbMATH DE number 3782387