Formal languages of labelled graphs

DOI10.1007/BF02241984MaRDI QIDQ1228365zbMATH OpenOpenAlexFDO

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

Cites work

• scientific article; zbMATH DE number 3493857 (Why is no real title available?)
• scientific article; zbMATH DE number 3346088 (Why is no real title available?)
• scientific article; zbMATH DE number 3386919 (Why is no real title available?)
• scientific article; zbMATH DE number 3405515 (Why is no real title available?)
• scientific article; zbMATH DE number 3410623 (Why is no real title available?)
• A Necessary and Sufficient Condition for Chomsky-Productions Over Partially Ordered Symbol Sets
• Parsing of Graph-Representable Pictures
• Plex languages
• Separable graphs, planar graphs and web grammars
• Web grammars and several graphs

Cited in

(10)

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

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

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