Infinite hypergraphs. I: Basic properties
From MaRDI portal
Some properties of the category of infinite directed hyperedge-labelled hypergraphs are studied in this paper. An algebraic structure is introduced to describe such hypergraphs by means of infinite expressions. It is also shown that two expressions define the same hypergraph if and only if they are congruent with respect to some rewriting system. These results are applied in solving systems of recursive equations on hypergraphs.
Recommendations
Cites work
- A fixpoint theorem for complete categories
- Algebraic specification of data types: A synthetic approach
- Categories of embeddings
- Continuous monoids and yields of infinite trees
- Fundamental properties of infinite trees
- Graph expressions and graph rewritings
- scientific article; zbMATH DE number 3967883 (Why is no real title available?)
- scientific article; zbMATH DE number 3987247 (Why is no real title available?)
- scientific article; zbMATH DE number 4035178 (Why is no real title available?)
- scientific article; zbMATH DE number 4047723 (Why is no real title available?)
- scientific article; zbMATH DE number 4059174 (Why is no real title available?)
- scientific article; zbMATH DE number 3675332 (Why is no real title available?)
- scientific article; zbMATH DE number 3738918 (Why is no real title available?)
- scientific article; zbMATH DE number 44486 (Why is no real title available?)
- scientific article; zbMATH DE number 3549200 (Why is no real title available?)
- scientific article; zbMATH DE number 3628344 (Why is no real title available?)
- scientific article; zbMATH DE number 3633737 (Why is no real title available?)
- scientific article; zbMATH DE number 3639170 (Why is no real title available?)
- scientific article; zbMATH DE number 4127475 (Why is no real title available?)
- scientific article; zbMATH DE number 1142315 (Why is no real title available?)
- scientific article; zbMATH DE number 3367095 (Why is no real title available?)
- Infinite hypergraphs. II: Systems of recursive equations
- Least fixed point of a functor
- On frontiers of regular trees
- Power domains
- Some fundamental algebraic tools for the semantics of computation: II. Signed and abstract theories
- The Category-Theoretic Solution of Recursive Domain Equations
- The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues
- 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
(14)- Infinite hypergraphs. II: Systems of recursive equations
- The monadic second-order logic of graphs, II: Infinite graphs of bounded width
- The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues
- scientific article; zbMATH DE number 177429 (Why is no real title available?)
- Representing hyper-graphs by regular languages
- scientific article; zbMATH DE number 2038741 (Why is no real title available?)
- A category-theoretical approach to vertex replacement: the generation of infinite graphs
- Node rewriting in graphs and hypergraphs: A categorical framework
- Incidence hypergraphs: the categorical inconsistency of set-systems and a characterization of quiver exponentials
- A uniform approach to graph rewriting: The pullback approach
- On systems of equations defining infinite graphs
- Automorphism groups of context-free graphs
- An axiomatization of graphs
- The monadic second-order logic of graphs. IV: Definability properties of equational graphs
This page was built for publication: Infinite hypergraphs. I: Basic properties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1814126)
