Simultaneously One-Turn Two-Pushdown Automata

DOI10.1080/0020716031000070616MaRDI QIDQ4464412zbMATH OpenOpenAlexFDO

Authors Alexander Meduna

Publication date 27 May 2004

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/0020716031000070616

zbMATH Keywords

recursively enumerable languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 1886071
• scientific article; zbMATH DE number 1439403
• A note on bounded-reversal multipushdown machines
• Automata with two-sided pushdowns defined over free groups generated by reduced alphabets
• scientific article; zbMATH DE number 3926247

Cites work

• scientific article; zbMATH DE number 3639163 (Why is no real title available?)
• On the generative power of regular pattern grammars

Cited in

(6)

• On the power of deep pushdown stacks
• Deep pushdown automata
• Prefix pushdown automata and their simplification
• scientific article; zbMATH DE number 1886071 (Why is no real title available?)
• Self-reproducing pushdown transducers
• Automata with two-sided pushdowns defined over free groups generated by reduced alphabets

This page was built for publication: Simultaneously One-Turn Two-Pushdown Automata

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