A pushdown automaton or a context-free grammar - which is more economical?

DOI10.1016/0304-3975(82)90110-4zbMATH Open0486.68082OpenAlexW2074593591MaRDI QIDQ1165026FDOQ1165026

Authors: Jonathan Goldstine, John K. Price, Detlef Wotschke 

Publication date: 1982

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(82)90110-4

zbMATH Keywords

context-free languagesreal-time deterministic pushdown automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25)

Cites Work

• Title not available (Why is that?)
• Optimization of LR(k) parsers
• A note on the succinctness of descriptions of deterministic languages
• Title not available (Why is that?)
• Finite-Turn Pushdown Automata
• Succinctness of Descriptions of Unambiguous Context-Free Languages
• Economy of description by parsers, DPDA's, and PDA's
• Title not available (Why is that?)
• Title not available (Why is that?)
• A helpful result for proving inherent ambiguity
• Title not available (Why is that?)
• Size complexity in context-free grammars forms

Cited In (11)

• DETERMINISTIC PUSHDOWN AUTOMATA AND UNARY LANGUAGES
• Deterministic Pushdown Automata and Unary Languages
• Unary context-free grammars and pushdown automata, descriptional complexity and auxiliary space lower bounds.
• Detecting useless transitions in pushdown automata
• Detecting useless transitions in pushdown automata
• Simulating finite automata with context-free grammars.
• Generating all permutations by context-free grammars in Greibach normal form
• Syntax checking either way
• Syntax checking either way
• On reducing the number of stack symbols in a PDA
• On reducing the number of states in a PDA

This page was built for publication: A pushdown automaton or a context-free grammar - which is more economical?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1165026)