Descriptional complexity of pushdown store languages

DOI10.1007/978-3-642-31623-4_16MaRDI QIDQ3167583zbMATH OpenOpenAlexFDO

Authors Andreas Malcher, Katja Meckel, Carlo Mereghetti, Beatrice Palano

Publication date 2 November 2012

Published in Descriptional Complexity of Formal Systems (Search for Journal in Brave)

Full work available at URL http://geb.uni-giessen.de/geb/volltexte/2012/9085/

zbMATH Keywords

decidability questionsdescriptional complexitypushdown automatapushdown store languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Descriptional complexity of pushdown store languages
• A direct construction of finite state automata for pushdown store languages
• On store languages of language acceptors
• scientific article; zbMATH DE number 3862469
• Pushdown automata with bounded nondeterminism and bounded ambiguity

Cited in

(8)

• On store languages of language acceptors
• On store languages and applications
• A direct construction of finite state automata for pushdown store languages
• Simplifying DPDA using supplementary information
• scientific article; zbMATH DE number 3862469 (Why is no real title available?)
• Prefix pushdown automata and their simplification
• Descriptional complexity of pushdown store languages
• Store languages of Turing machines and counter machines

This page was built for publication: Descriptional complexity of pushdown store languages

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