Pumping lemmas for special linear languages

zbMATH Open1245.68127MaRDI QIDQ2909021

Benedek Nagy

Publication date: 29 August 2012

zbMATH Keywords

regular languagespumping lemmaderivation tree\(k\)-rated linear languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

Title not available (Why is that?) ⋮ A PUMPING CONDITION FOR ULTRALINEAR LANGUAGES ⋮ Pumping Lemma for Higher-order Languages

Recommendations

• A pumping lemma for deterministic context-free languages 👍 👎
• A pumping lemma for \textbf{DLI}-languages 👍 👎
• A pumping lemma for flip-pushdown languages 👍 👎
• A PUMPING CONDITION FOR ULTRALINEAR LANGUAGES 👍 👎
• Pumping Lemma for Higher-order Languages 👍 👎
• Formalization of the pumping lemma for context-free languages 👍 👎
• Pumping lemmas for classes of languages generated by folding systems 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: Pumping lemmas for special linear languages

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