On reducing the number of stack symbols in a PDA
From MaRDI portal
Publication:3141998
DOI10.1007/BF01189852zbMath0793.68103MaRDI QIDQ3141998
Jonathan Goldstine, Detlef Wotschke, John K. Price
Publication date: 21 August 1994
Published in: Mathematical Systems Theory (Search for Journal in Brave)
68Q45: Formal languages and automata
Related Items
Cites Work
- Unnamed Item
- On Goedel speed-up and succinctness of language representations
- On measuring nondeterminism in regular languages
- Amounts of nondeterminism in finite automata
- A pushdown automaton or a context-free grammar - which is more economical?
- Regularity and Related Problems for Deterministic Pushdown Automata
- A note on the succinctness of descriptions of deterministic languages
- Succinctness of Descriptions of Unambiguous Context-Free Languages
- A regularity test for pushdown machines
- An Infinite Hierarchy of Context-Free Languages