Formal languages of labelled graphs

DOI10.1007/BF02241984zbMath0333.68054OpenAlexW130248688MaRDI QIDQ1228365

K. Appert

Publication date: 1976

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02241984

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algorithms in computer science (68W99)

Related Items (9)

Graph traversal and graph transformation ⋮ Data complexity measured by principal graphs ⋮ On the generative power of sequential and parallel programmed graph grammars ⋮ Node replacement in hypergraphs: Simulation of hyperedge replacement, and decidability of confluence ⋮ Finite graph automata for linear and boundary graph languages ⋮ On labelled graph grammars ⋮ Topological grammars for data approximation ⋮ The conical methodology and the evolution of simulation model development ⋮ The complexity of the \(K_{n,n}\)-problem for node replacement graph languages

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Plex languages
• Web grammars and several graphs
• Separable graphs, planar graphs and web grammars
• Parsing of Graph-Representable Pictures
• A Necessary and Sufficient Condition for Chomsky-Productions Over Partially Ordered Symbol Sets

This page was built for publication: Formal languages of labelled graphs