Time complexity of loop-free two-way pushdown automata
type: Item
instance of: scholarly article
title: Time complexity of loop-free two-way pushdown automata
zbMATH Open document ID: 0511.68053
DOI: 10.1016/0020-0190(83)90063-7
author: Wojciech Rytter
published in: Information Processing Letters
publication date: 1983-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68Q05
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 3806959
zbMATH Keywords: simulation
zbMATH Keywords: time complexity
zbMATH Keywords: algorithm for the fast recognition of languages recognized by two-way nondeterministic pushdown automata
MaRDI profile type: Publication
full work available at URL: 0020-0190(83)90063-7
OpenAlex ID: W2044199853
cites work: Time and tape complexity of pushdown automaton languages
cites work: Q4773298
cites work: Q3919065
cites work: Improving programs by the introduction of recursion
cites work: Q4144216
cites work: A note on two-way nondeterministic pushdown automata
cites work: An effective simulation of deterministic pushdown automata with many two- way and one-way heads
cites work: General context-free recognition in less than cubic time
description: scientific article; zbMATH DE number 3806959