scientific article; zbMATH DE number 522860

MaRDI QIDQ4284255zbMATH OpenFDO

Authors Sabine Kuske

Publication date 24 March 1994

zbMATH Keywords

edge-replacement grammaredge-replacement languagesmaximum path lengthpumping lemma

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• A pumping lemma and the structure of derivations in the boundary NLC graph languages
• A pumping lemma for pushdown graphs of any level
• The Pumping Lemma for Well-Nested Multiple Context-Free Languages
• A pumping lemma for collapsible pushdown graphs of level 2
• Characteristics of graph languages generated by edge replacement

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