Infinite hypergraphs. II: Systems of recursive equations
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4059174 (Why is no real title available?)
- scientific article; zbMATH DE number 177429 (Why is no real title available?)
- scientific article; zbMATH DE number 1142312 (Why is no real title available?)
- scientific article; zbMATH DE number 1142314 (Why is no real title available?)
- An internal presentation of regular graphs by prefix-recognizable graphs
- Fundamental properties of infinite trees
- Graph expressions and graph rewritings
- Infinite hypergraphs. I: Basic properties
- The monadic second-order logic of graphs. IV: Definability properties of equational graphs
- The theory of ends, pushdown automata, and second-order logic
Cited in
(9)- Infinite hypergraphs. I: Basic properties
- An axiomatization of graphs
- Automorphism groups of context-free graphs
- scientific article; zbMATH DE number 177429 (Why is no real title available?)
- Node rewriting in graphs and hypergraphs: A categorical framework
- Graph expressions and graph rewritings
- On systems of equations defining infinite graphs
- A category-theoretical approach to vertex replacement: the generation of infinite graphs
- A uniform approach to graph rewriting: The pullback approach
This page was built for publication: Infinite hypergraphs. II: Systems of recursive equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1199532)
