Concatenation of graphs
From MaRDI portal
Publication:4645288
Recommendations
Cites work
- scientific article; zbMATH DE number 3854429 (Why is no real title available?)
- scientific article; zbMATH DE number 4047616 (Why is no real title available?)
- scientific article; zbMATH DE number 3660804 (Why is no real title available?)
- scientific article; zbMATH DE number 3455154 (Why is no real title available?)
- scientific article; zbMATH DE number 1142315 (Why is no real title available?)
- scientific article; zbMATH DE number 1456950 (Why is no real title available?)
- scientific article; zbMATH DE number 3251427 (Why is no real title available?)
- scientific article; zbMATH DE number 3282607 (Why is no real title available?)
- scientific article; zbMATH DE number 3413820 (Why is no real title available?)
- A Kleene theorem for a class of planar acyclic graphs
- Absolutely parallel grammars and two-way finite-state transducers
- Context-free graph grammars and concatenation of graphs
- Context-free graph languages of bounded degree are generated by apex graph grammars
- Ein Vollständigkeitssatz für Programme und Schaltkreise. (A completeness theorem for programs and switching circuits.)
- Graph expressions and graph rewritings
- Handle-rewriting hypergraph grammars
- Hyperedge replacement: grammars and languages
- One way finite visit automata
- The basic algebraic structures in categories of derivations
- The string generating power of context-free hypergraph grammars
- Tree transducers, L systems, and two-way machines
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)