On reducing the number of states in a PDA

DOI10.1007/BF01786988zbMATH Open0487.68047OpenAlexW2019570031MaRDI QIDQ3948599FDOQ3948599

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

Publication date: 1982

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

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

zbMATH Keywords

transformationpushdown automatonloss of deterministic behaviorrealtime behavior

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Optimization of LR(k) parsers
• Title not available (Why is that?)
• On context-free languages and push-down automata
• Mappings which preserve context sensitive languages
• Complexity and unambiguity of context-free grammars and languages
• A pushdown automaton or a context-free grammar - which is more economical?

Cited In (3)

• Digging input-driven pushdown automata
• Detecting useless transitions in pushdown automata
• Generating all permutations by context-free grammars in Greibach normal form

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

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