Automata with two-sided pushdowns defined over free groups generated by reduced alphabets

MaRDI QIDQ5446606zbMATH OpenFDO

Authors Petr Blatný, Radek Bidlo, Alexander Meduna

Publication date 6 March 2008

Full work available at URL https://eudml.org/doc/33857, http://www.kybernetika.cz/content/2007/3/265

zbMATH Keywords

recursively enumerable languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Simultaneously One-Turn Two-Pushdown Automata
• Finite automata over free groups
• scientific article; zbMATH DE number 5155118
• Prefix pushdown automata and their simplification
• scientific article; zbMATH DE number 1886071

Cites work

• Automata and languages. Theory and applications
• Checking automata and one-way stack languages
• Finite-Turn Pushdown Automata
• Flip-pushdown automata: k+1 pushdown reversals are better than k
• scientific article; zbMATH DE number 3727583 (Why is no real title available?)
• scientific article; zbMATH DE number 1142312 (Why is no real title available?)
• scientific article; zbMATH DE number 1178947 (Why is no real title available?)
• scientific article; zbMATH DE number 195162 (Why is no real title available?)
• scientific article; zbMATH DE number 1886071 (Why is no real title available?)
• On jump-deterministic pushdown automata
• On the generative power of regular pattern grammars
• One-way stack automata
• Simultaneously One-Turn Two-Pushdown Automata

Cited in

(4)

• scientific article; zbMATH DE number 3874644 (Why is no real title available?)
• Prefix pushdown automata and their simplification
• Simultaneously One-Turn Two-Pushdown Automata
• On pure multi-pushdown automata that perform complete pushdown pops

This page was built for publication: Automata with two-sided pushdowns defined over free groups generated by reduced alphabets

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