scientific article; zbMATH DE number 3883637

MaRDI QIDQ3217629zbMATH OpenFDO

Authors Danièle Girault-Beauquier

Publication date 1984

zbMATH Keywords

infinitary languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Sets of Infinite Words Recognized by Deterministic One-Turn Pushdown Automata
• PUSHDOWN AUTOMATA ON INFINITE TREES AND NONDETERMINISTIC CONTEXT-FREE PROGRAMS
• Context-dependent nondeterminism for pushdown automata
• scientific article; zbMATH DE number 4045202
• scientific article; zbMATH DE number 17822

Cited in

(7)

• Ambiguity in omega context free languages
• Trimming visibly pushdown automata
• An infinite hierarchy of language families resulting from stateless pushdown automata with limited pushdown alphabets
• Sets of Infinite Words Recognized by Deterministic One-Turn Pushdown Automata
• scientific article; zbMATH DE number 4771 (Why is no real title available?)
• A Note on Pushdown Automata Systems
• Wadge hierarchy of omega context-free languages

This page was built for publication:

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