A pushdown automaton or a context-free grammar - which is more economical?
type: Item
instance of: scholarly article
title: A pushdown automaton or a context-free grammar - which is more economical?
zbMATH Open document ID: 0486.68082
DOI: 10.1016/0304-3975(82)90110-4
author: Jonathan Goldstine
author: John K. Price
author: Detlef Wotschke
published in: Theoretical Computer Science
publication date: 1982-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 3765182
zbMATH Keywords: real-time deterministic pushdown automaton
zbMATH Keywords: context-free languages
MaRDI profile type: Publication
full work available at URL: 0304-3975(82)90110-4
OpenAlex ID: W2074593591
cites work: Optimization of LR(k) parsers
cites work: Economy of description by parsers, DPDA's, and PDA's
cites work: Q5576254
cites work: Size complexity in context-free grammars forms
cites work: Finite-Turn Pushdown Automata
cites work: Q4105792
cites work: Q5592246
cites work: A helpful result for proving inherent ambiguity
cites work: Q4070333
cites work: Q4080744
cites work: Succinctness of Descriptions of Unambiguous Context-Free Languages
cites work: A note on the succinctness of descriptions of deterministic languages
description: scientific article; zbMATH DE number 3765182