scientific article; zbMATH DE number 4170113

MaRDI QIDQ3495660zbMATH OpenFDO

Authors Tudor Bălănescu, Marian Gheorghe

Publication date 1991

zbMATH Keywords

pumping lemmaregular languagespf(k)-parsable languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Theory of compilers and interpreters (68N20)

Recommendations

• Hierarchy ofk-context-free languages
• Hierarchy of k-context-free languages part 1
• scientific article; zbMATH DE number 2211803
• A pumping result for 2-context-free languages
• \(\mathcal{PS}\)-regular languages

Cited in

(3)

• A polynomial-time parsing algorithm for \(K\)-depth languages
• Hierarchy ofk-context-free languages
• A CHARACTERIZATION OF PARIKH SETS OF ET0L LANGUAGES IN TERMS OF P SYSTEMS

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