Hypermap rewriting: A combinatorial approach

DOI10.1016/0304-3975(91)90183-3MaRDI QIDQ1178702zbMATH OpenOpenAlexFDO

Authors Éric Sopena

Publication date 26 June 1992

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

Full work available at URL https://doi.org/10.1016/0304-3975(91)90183-3

zbMATH Keywords

decidabilitygraph grammarcombinatorial hypermapshyperedge rewriting

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Hypergraphs (05C65) Grammars and rewriting systems (68Q42)

Recommendations

• scientific article; zbMATH DE number 4041304
• Handle-rewriting hypergraph grammars
• Hypergraph languages of bounded degree
• Context-free hypergraph grammars with node rewriting
• The generative power of context-free node rewriting in hypergraphs

Cites work

• scientific article; zbMATH DE number 3827227 (Why is no real title available?)
• scientific article; zbMATH DE number 4041304 (Why is no real title available?)
• scientific article; zbMATH DE number 4049064 (Why is no real title available?)
• scientific article; zbMATH DE number 4049095 (Why is no real title available?)
• scientific article; zbMATH DE number 4066917 (Why is no real title available?)
• scientific article; zbMATH DE number 3489159 (Why is no real title available?)
• scientific article; zbMATH DE number 3631952 (Why is no real title available?)
• An axiomatic definition of context-free rewriting and its application to NLC graph grammars
• Characteristics of graph languages generated by edge replacement
• Combinatorial Oriented Maps
• Combinatorial maps
• Decision problems for node label controlled graph grammars
• Equipartite colorings in graphs and hypergraphs
• Graph expressions and graph rewritings
• Graph-encoded maps
• Graph-grammars and their application to computer science. 3rd International Workshop, Warrenton, Virginia, USA, December 2-6, 1986
• Hypermaps versus bipartite maps
• Matrice de ramification des arbres binaires. (Ramification matrices of binary trees)
• Node rewriting in graphs and hypergraphs: A categorical framework
• On sequential and parallel node-rewriting graph grammars
• On sequential and parallel node-rewriting graph grammars, II
• Theory of Maps on Orientable Surfaces

Cited in

(2)

• scientific article; zbMATH DE number 1166252 (Why is no real title available?)
• scientific article; zbMATH DE number 4041304 (Why is no real title available?)

This page was built for publication: Hypermap rewriting: A combinatorial approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1178702)