scientific article; zbMATH DE number 3633740

MaRDI QIDQ4194482zbMATH OpenFDO

Authors Hans-Jörg Kreowski

Publication date 1979

zbMATH Keywords

Context-Free Graph LanguagesEdge-Replacement Context- Free Graph GrammarsPumping Lemma

Mathematics Subject Classification ID

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

Cited in

(6)

• String grammars with disconnecting or a basic root of the difficulty in graph grammar parsing
• Characteristics of graph languages generated by edge replacement
• On the generative power of sequential and parallel programmed graph grammars
• Graph grammars with string-regulated rewriting
• Moving a derivation along a derivation preserves the spine
• Moving a derivation along a derivation preserves the spine in adhesive categories

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