On pure multi-pushdown automata that perform complete pushdown pops

MaRDI QIDQ5306175zbMATH OpenFDO

Authors Tomáš Masopust, Alexander Meduna

Publication date 8 April 2010

zbMATH Keywords

complete pushdown popinfinite hierarchypure multi-pushdown automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Eliminating stack symbols in push-down automata and linear indexed grammars
• Deep pushdown automata
• Automata with two-sided pushdowns defined over free groups generated by reduced alphabets
• Emptiness of Multi-pushdown Automata Is 2ETIME-Complete
• An infinite hierarchy of language families resulting from stateless pushdown automata with limited pushdown alphabets

Cited in

(2)

• Eliminating stack symbols in push-down automata and linear indexed grammars
• Variations on pushdown machines (Detailed Abstract)

This page was built for publication: On pure multi-pushdown automata that perform complete pushdown pops

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