Concatenation of graphs

DOI10.1007/3-540-61228-9_99zbMath1412.68128OpenAlexW1868282642MaRDI QIDQ4645288

Jan Joris Vereijken, Joost Engelfriet

Publication date: 10 January 2019

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61228-9_99

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Hyperedge replacement: grammars and languages
• Tree transducers, L systems, and two-way machines
• The string generating power of context-free hypergraph grammars
• One way finite visit automata
• Context-free graph languages of bounded degree are generated by apex graph grammars
• Context-free graph grammars and concatenation of graphs
• A Kleene theorem for a class of planar acyclic graphs
• Handle-rewriting hypergraph grammars
• Ein Vollständigkeitssatz für Programme und Schaltkreise. (A completeness theorem for programs and switching circuits.)
• Absolutely parallel grammars and two-way finite-state transducers
• Graph expressions and graph rewritings
• The basic algebraic structures in categories of derivations
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item