On reducing the number of stack symbols in a PDA

DOI10.1007/BF01189852zbMATH Open0793.68103OpenAlexW2023445075MaRDI QIDQ3141998FDOQ3141998

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

Publication date: 21 August 1994

Published in: Mathematical Systems Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01189852

Recommendations

• scientific article
• Parikh image of pushdown automata
• scientific article; zbMATH DE number 4074488
• Descriptional complexity of pushdown store languages
• A direct construction of finite state automata for pushdown store languages

zbMATH Keywords

nondeterminismpushdown automatondeterminism-preserving transformations

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Amounts of nondeterminism in finite automata
• Regularity and Related Problems for Deterministic Pushdown Automata
• A note on the succinctness of descriptions of deterministic languages
• A regularity test for pushdown machines
• An Infinite Hierarchy of Context-Free Languages
• On Goedel speed-up and succinctness of language representations
• Succinctness of Descriptions of Unambiguous Context-Free Languages
• On measuring nondeterminism in regular languages
• Title not available (Why is that?)
• A pushdown automaton or a context-free grammar - which is more economical?

Cited In (7)

• Simplifying DPDA using supplementary information
• Regulated nondeterminism in pushdown automata
• Digging input-driven pushdown automata
• Title not available (Why is that?)
• Regulated Nondeterminism in Pushdown Automata
• Detecting useless transitions in pushdown automata
• Title not available (Why is that?)

This page was built for publication: On reducing the number of stack symbols in a PDA

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