On inverse deterministic pushdown transductions
type: Item
instance of: scholarly article
title: On inverse deterministic pushdown transductions
zbMATH Open document ID: 0376.68051
DOI: 10.1016/0022-0000(78)90028-4
author: Walter Savitch
author: Paul M. B. Vitányi
published in: Journal of Computer and System Sciences
publication date: 1978-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 3586504
MaRDI profile type: Publication
full work available at URL: 0022-0000(78)90028-4
OpenAlex ID: W2038503876
cites work: The theory of languages
cites work: Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
cites work: Abstract families of deterministic languages
cites work: Recognition time of context-free languages by on-line Turing machines
cites work: Deterministic context free languages
cites work: Two-way pushdown automata
cites work: The Hardest Context-Free Language
cites work: Jump PDA’s and Hierarchies of Deterministic Context-Free Languages
cites work: Q5592246
cites work: Space-bounded reducibility among combinatorial problems
cites work: A universal context-free grammar
cites work: Q5180413
cites work: Relationships between nondeterministic and deterministic tape complexities
cites work: How to Make Arbitrary Grammars Look Like Context-Free Grammars
cites work: Q4140411
cites work: On the Tape Complexity of Deterministic Context-Free Languages
description: scientific article; zbMATH DE number 3586504