scientific article; zbMATH DE number 3827231

MaRDI QIDQ3673131zbMATH OpenFDO

Authors Annegret Habel, Hans-Jörg Kreowski

Publication date 1983

zbMATH Keywords

context-free graph languagesedge replacement systemsfixed-point theoremgraph grammarsnode replacement systemsrecursive transition networks

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cited in

(5)

• Characteristics of graph languages generated by edge replacement
• Metatheorems for decision problems on hyperedge replacement graph languages
• Lyndon trees
• Graph-theoretic properties compatible with graph derivations
• Edge-label controlled graph grammars

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