Concatenation of graphs
From MaRDI portal
Publication:4645288
DOI10.1007/3-540-61228-9_99zbMATH Open1412.68128OpenAlexW1868282642MaRDI QIDQ4645288FDOQ4645288
Authors: 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
Recommendations
Formal languages and automata (68Q45) Graph operations (line graphs, products, etc.) (05C76) Grammars and rewriting systems (68Q42)
Cites Work
- Hyperedge replacement: grammars and languages
- Handle-rewriting hypergraph grammars
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Tree transducers, L systems, and two-way machines
- Title not available (Why is that?)
- 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
- Graph expressions and graph rewritings
- Title not available (Why is that?)
- The basic algebraic structures in categories of derivations
- A Kleene theorem for a class of planar acyclic graphs
- Ein Vollständigkeitssatz für Programme und Schaltkreise. (A completeness theorem for programs and switching circuits.)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The string generating power of context-free hypergraph grammars
- Absolutely parallel grammars and two-way finite-state transducers
- Title not available (Why is that?)
Cited In (4)
This page was built for publication: Concatenation of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4645288)
