On reducing the number of stack symbols in a PDA
From MaRDI portal
Publication:3141998
Recommendations
Cites work
- scientific article; zbMATH DE number 3640909 (Why is no real title available?)
- A note on the succinctness of descriptions of deterministic languages
- A pushdown automaton or a context-free grammar - which is more economical?
- A regularity test for pushdown machines
- Amounts of nondeterminism in finite automata
- An Infinite Hierarchy of Context-Free Languages
- On Goedel speed-up and succinctness of language representations
- On measuring nondeterminism in regular languages
- Regularity and Related Problems for Deterministic Pushdown Automata
- Succinctness of Descriptions of Unambiguous Context-Free Languages
Cited in
(9)- Detecting useless transitions in pushdown automata
- Detecting useless transitions in pushdown automata
- Regulated Nondeterminism in Pushdown Automata
- Generalizing Cook's transformation to imperative stack programs
- Digging input-driven pushdown automata
- Simplifying DPDA using supplementary information
- scientific article; zbMATH DE number 4178795 (Why is no real title available?)
- Regulated nondeterminism in pushdown automata
- scientific article; zbMATH DE number 4074488 (Why is no real title available?)
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)