scientific article; zbMATH DE number 4045202

MaRDI QIDQ3782820zbMATH OpenFDO

Authors Qingquan Guo, Lixing Chen

Publication date 1986

zbMATH Keywords

\(\omega \)-finite-turncontext-free languagesemptying storehierarchypush-down automatastate repetition set

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 4043282
• Finite turns and the regular closure of linear context-free languages
• Ambiguity in omega context free languages
• scientific article; zbMATH DE number 4114062
• \(\omega\)-power context-free languages and their closure properties

Cited in

(9)

• On omega context free languages which are Borel sets of infinite rank.
• \(\omega\)-power context-free languages and their closure properties
• Logic for \(\omega\)-pushdown automata
• Finite turns and the regular closure of linear context-free languages
• scientific article; zbMATH DE number 3883637 (Why is no real title available?)
• Sets of Infinite Words Recognized by Deterministic One-Turn Pushdown Automata
• scientific article; zbMATH DE number 4043282 (Why is no real title available?)
• scientific article; zbMATH DE number 4114062 (Why is no real title available?)
• Fairness for pushdown automata.

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 Q3782820)