Infinite hypergraphs. II: Systems of recursive equations

DOI10.1016/0304-3975(92)90011-4zbMath0762.05080OpenAlexW1483334519MaRDI QIDQ1199532

Michel Bauderon

Publication date: 16 January 1993

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(92)90011-4

zbMATH Keywords

recursive equationsinfinite hypergraphscontext-free graphsequational hypergraphs

Mathematics Subject Classification ID

Hypergraphs (05C65)

Related Items (6)

A uniform approach to graph rewriting: The pullback approach ⋮ Graph expressions and graph rewritings ⋮ Automorphism groups of context-free graphs ⋮ A category-theoretical approach to vertex replacement: The generation of infinite graphs ⋮ Node rewriting in graphs and hypergraphs: A categorical framework ⋮ Infinite hypergraphs. I: Basic properties

Cites Work

• The monadic second-order logic of graphs. IV: Definability properties of equational graphs
• Fundamental properties of infinite trees
• The theory of ends, pushdown automata, and second-order logic
• Infinite hypergraphs. I: Basic properties
• Graph expressions and graph rewritings
• An internal presentation of regular graphs by prefix-recognizable graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Infinite hypergraphs. II: Systems of recursive equations