scientific article; zbMATH DE number 17822

MaRDI QIDQ3975166zbMATH OpenFDO

Authors Ahmed Saoudi

Publication date 26 June 1992

zbMATH Keywords

infinite treesKleene's theoremEilenberg's theoremautomaton characterizations of context-free program schemesGreibach program schemesLandweber-Staiger-Wagner hierarchy

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• PUSHDOWN AUTOMATA ON INFINITE TREES AND NONDETERMINISTIC CONTEXT-FREE PROGRAMS
• scientific article; zbMATH DE number 4096786
• A NEW TYPE OF PUSHDOWN AUTOMATA ON INFINITE TREES
• Infinite trees and automaton-definable relations over \(\omega\)-words
• Infinitary tree languages recognized by \(\omega\)-automata
• scientific article; zbMATH DE number 4208050
• scientific article; zbMATH DE number 3982544
• scientific article; zbMATH DE number 3993563
• Pushdown automata free of explicit nondeterminism and an infinite hierarchy of context-free languages
• On automata on infinite trees

Cited in

(4)

• PUSHDOWN AUTOMATA ON INFINITE TREES AND NONDETERMINISTIC CONTEXT-FREE PROGRAMS
• scientific article; zbMATH DE number 4096786 (Why is no real title available?)
• scientific article; zbMATH DE number 3883637 (Why is no real title available?)
• scientific article; zbMATH DE number 408813 (Why is no real title available?)

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