ScienceOpen:
research and publishing network
For Publishers
Discovery
Metadata
Peer review
Hosting
Publishing
For Researchers
Join
Publish
Review
Collect
My ScienceOpen
Sign in
Register
Dashboard
Blog
About
Search
Advanced search
My ScienceOpen
Sign in
Register
Dashboard
Search
Search
Advanced search
For Publishers
Discovery
Metadata
Peer review
Hosting
Publishing
For Researchers
Join
Publish
Review
Collect
Blog
About
20
views
19
references
Top references
cited by
3
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
2,439
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Graph Grammars and Their Application to Computer Science
Context-free handle-rewriting hypergraph grammars
other
Author(s):
Bruno Courcelle
,
Joost Engelfriet
,
Grzegorz Rozenberg
Publication date
(Print):
1991
Publisher:
Springer-Verlag
Read this book at
Publisher
Buy book
Review
Review book
Invite someone to review
Bookmark
Cite as...
There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
Sex and gender-sensitive medicine
Most cited references
19
Record
: found
Abstract
: not found
Article
: not found
The monadic second-order logic of graphs. I. Recognizable sets of finite graphs
Bruno Courcelle
(1990)
0
comments
Cited
223
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Graph expressions and graph rewritings
Bruno Courcelle
,
Michel Bauderon
(1987)
0
comments
Cited
25
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Algebraic automata and context-free sets
J. Mezei
,
J.B. Wright
(1967)
0
comments
Cited
23
times
– based on
0
reviews
Review now
Bookmark
All references
Author and book information
Book Chapter
Pages
: 253-268
DOI:
10.1007/BFb0017394
SO-VID:
6ff94ccb-2d20-4b6e-9243-3e1a6a93cbaf
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 113
General solution to a system of recursive equations on hypergraphs
pp. 490
Graph rewriting in some categories of partial morphisms
pp. 520
Tree automata, tree decomposition and hyperedge replacement
pp. 253
Context-free handle-rewriting hypergraph grammars
Similar content
2,439
Revisiting User Mobility and Social Relationships in LBSNs: A Hypergraph Embedding Approach
Authors:
Yang
Flexible rewritable organic memory devices using nitrogen-doped CNTs/PEDOT:PSS composites
Authors:
J.A. Ávila-Niño
,
D. Hérnandez-Arriaga
,
R. López-Sandoval
…
A Dihydroazulene‐Based Photofluorochromic AIE System for Rewritable 4D Information Encryption
Authors:
Jianyu Zhang
,
Hanchen Shen
,
Xinyue Liu
…
See all similar
Cited by
3
Handle-rewriting hypergraph grammars
Authors:
Bruno Courcelle
,
Joost Engelfriet
,
Grzegorz Rozenberg
On Parameterized Approximability
Authors:
Yijia Chen
,
Martin Grohe
,
Magdalena Grüber
A SAT Approach to Clique-Width
Authors:
Stefan Szeider
,
Marijn Heule
See all cited by