Filters








315 Hits in 3.6 sec

Normal forms for context-free node-rewriting hypergraph grammars

RENATE KLEMPIEN-HINRICHS
2002 Mathematical Structures in Computer Science  
doi:10.1017/s0960129501003528 fatcat:dazbablrwrbnhkpbep2t25fhee

Page 5769 of Mathematical Reviews Vol. , Issue 2000h [page]

2000 Mathematical Reviews  
S-HRNCE grammars have normal forms, in- cluding Chomsky, Greibach and context-free normal forms.  ...  For grammars generating hypergraphs there are two well-known models, the context-free hypergraph (CFHG) grammars by Boud- eron and Courcelle and by Habel et al., which replace a hyper- edge by a hypergraph  ... 

HRNCE grammars — a hypergraph generating system with an eNCE way of rewriting

Changwook Kim, Tae Eui Jeong
1999 Theoretical Computer Science  
Separated HRNCE (S-HRNCE) grammars have many useful normal forms, including Chomsky, Greibach, and context-free normal forms.  ...  An HRNCE grammar replaces a handle (i.e., a hyperedge together with its incident nodes) by a hypergraph, whose nodes are connected to (or contained in) the hyperedges surrounding the replaced handle by  ...  To transform an S-HRNCE grammar G into the Greibach normal form, we shall use a method similar to the one for context-free grammars.  ... 
doi:10.1016/s0304-3975(99)00258-3 fatcat:7kulb5wykzegbhonizj5ol6jg4

Page 5380 of Mathematical Reviews Vol. , Issue 94i [page]

1994 Mathematical Reviews  
This generalizes the dou- ble Greibach normal form of context-free grammars. Moreover, it provides a natural grammatical characterization of the context- free hypergraph languages of bounded degree.  ...  Subramanian (6-MDRCC; Madras) 94i:68165 68Q50 Engelfriet, Joost (NL-LEID-CS; Leiden) A Greibach normal form for context-free graph grammars.  ... 

Page 2882 of Mathematical Reviews Vol. , Issue 2003d [page]

2003 Mathematical Reviews  
{For the entire collection see MR 2003b:68007.} 2003d:68123 68Q42 Klempien-Hinrichs, Renate (D-BRMN; Bremen) Normal forms for context-free node-rewriting hypergraph grammars.  ...  Confluent node-rewriting hypergraph grammars (C-hNCE gram- mars) were introduced in [R.  ... 

Hypergraph languages of bounded degree

Joost Engelfriet, Linda Heyker
1994 Journal of computer and system sciences (Print)  
Two types of hypergraph rewriting grammar are considered: the well-known context-free hypergraph grammar (or CFHG grammar, also known as hyperedge replacement system or HR system) and tile more recent  ...  separated handle hypergraph grammar (or S-HH grammar).  ...  For reasons of clarity (and to simplify the comparison to context-free hypergraph grammars), we would like to put S-HH grammars into a normal form for which this change of environment is as simple as possible  ... 
doi:10.1016/s0022-0000(05)80022-4 fatcat:h7qp4muenjbgpaj32fnzcb6qbe

Relational data base design using refinement rules

C. Batini, A. d'Atri
1983 RAIRO Informatique théorique  
In the hypergraph formalism we need a concept of (context free) rewriting rule and hypergraph grammar to characterize top-down schema génération.  ...  In fact in its full generality the problem is complex and cannot be solved in the framework of context free grammars. We say that HeJf?  ... 
doi:10.1051/ita/1983170200971 fatcat:rovp5nli5zepxah264zls45fle

Hypermap rewriting: a combinatorial approach

Eric Sopena
1991 Theoretical Computer Science  
., Hypermap rewriting: a combinatorial approach, Theoretical Computer Science 85 (1991) 253-281. Combinatorial hypermaps may be viewed as topological representations of hypergraphs.  ...  We also investigate a special kind of hypermap grammars, the H-grammars, for which we give a pumping theorem enlightening the combinatorial structure of the generated hypermap languages.  ...  We show that these grammars may be considered as context-free hypermap grammars and provide a pumping theorem for them.  ... 
doi:10.1016/0304-3975(91)90183-3 fatcat:yzfygcgsn5fu7e4ahlhbiauryi

Context-free hypergraph grammars have the same term-generating power as attribute grammars

Joost Engelfriet, Linda Heyker
1992 Acta Informatica  
Context-free hypergraph grammars and attribute grammars generate the same class of term languages.  ...  Extending the context-free hypergraph grammar with a context-free grammar and a semantic domain, a syntax-directed translation device is obtained that is equivalent to the attribute grammar.  ...  The authors wish to thank George Leih for several useful observations. The remarks of the referees have been very helpful in writing the conclusion.  ... 
doi:10.1007/bf01178504 fatcat:spgr3hfupzdchnqlxopuf6wnru

HYPEREDGE REPLACEMENT GRAPH GRAMMARS [chapter]

F. DREWES, H.-J. KREOWSKI, A. HABEL
1997 Handbook of Graph Grammars and Computing by Graph Transformation  
In particular, hyperedge replacement graph grammars are discussed as a (hyper)graph-grammatical counterpart to context-free string grammars.  ...  In this survey the concept of hyperedge replacement is presented as an elementary approach to graph and hypergraph generation.  ...  Acknowledgement We thank Grzegorz Rozenberg and the anonymous referee for helpful comments on a draft of this chapter.  ... 
doi:10.1142/9789812384720_0002 fatcat:snksvj3gnfavxmy5ff4732mpnu

A Framework for Rewriting Families of String Diagrams

Vladimir Zamdzhiev
2019 Electronic Proceedings in Theoretical Computer Science  
We model equations between infinite families of diagrams using rewrite rules between context-free grammars.  ...  Our framework represents equational reasoning about concrete string diagrams and context-free families of string diagrams using double-pushout rewriting on graphs and context-free graph grammars respectively  ...  I would like to thank Aleks Kissinger for many fruitful discussions and also for his supervision of my PhD studies, during which time these results were discovered.  ... 
doi:10.4204/eptcs.288.6 fatcat:5luksjek75ev7afcyord3aqkgq

Tree Transducers and Tree Compressions [chapter]

Sebastian Maneth, Giorgio Busatto
2004 Lecture Notes in Computer Science  
Consider an attribute grammar that generates trees as output.  ...  A similar result holds for macro forest transducers which translate unranked forests, i.e., natural representations of XML documents.  ...  The first author is grateful to Markus Lohrey for providing many useful references, and in particular for the introduction to the concept of sharing graphs.  ... 
doi:10.1007/978-3-540-24727-2_26 fatcat:7tzr7rrdyjf5lny7i2pdzilyqq

Hypergraphs as a Uniform Diagram Representation Model [chapter]

Mark Minas
2000 Lecture Notes in Computer Science  
This paper also proposes a procedure for translating diagrams into their hypergraph model, i.e., a graphical scanner, and a procedure to check the hypergraph against a hypergraph grammar defining the diagrams  ...  Graphs and hypergraphs are well-known concepts for such internal models.  ...  [14] has discussed efficient parsers for context-free hypergraph grammars with optional embedding productions: Similar to context-free string grammars, context-free hypergraph grammars are defined in  ... 
doi:10.1007/978-3-540-46464-8_20 fatcat:krbb4rr23rcvxpsusgunaephjq

Second-Order Abstract Categorial Grammars as Hyperedge Replacement Grammars

Makoto Kanazawa
2009 Journal of Logic, Language and Information  
It is known that the string generating power of both formalisms is equivalent to (non-erasing) multiple context-free grammars (Seki et al. 1991) or linear context-free rewriting systems (Weir 1988).  ...  The normal form for tree-generating hyperedge replacement grammars given by Engelfriet and Maneth (2000) can then be used to show that the tree generating power of second-order ACGs is exactly the same  ...  et al. 1991) , or string-based linear context-free rewriting systems (Weir 1988) , and linear non-deleting context-free tree grammars (Rounds 1970, Engelfriet and Schmidt 1977, Kepser and Mönnich) can  ... 
doi:10.1007/s10849-009-9109-6 fatcat:onj4chqsxbf7lhysmd3hwc3cwa

On the Decidability Status of Reachability and Coverability in Graph Transformation Systems

Nathalie Bertrand, Giorgio Delzanno, Barbara König, Arnaud Sangnier, Jan Stückrath, Marc Herbstritt
2012 International Conference on Rewriting Techniques and Applications  
In this paper we reformulate results obtained, e.g., for context-free graph grammars and concurrency models, such as Petri nets, in the more general setting of graph transformation systems and study new  ...  results for classes of models obtained by adding constraints on the form of reduction rules.  ...  Acknowledgements: We would like to thank Roland Meyer for interesting discussions about several aspects of this work.  ... 
doi:10.4230/lipics.rta.2012.101 dblp:conf/rta/BertrandDKSS12 fatcat:62mssb5jebadxaiw7ojdlp2c7e
« Previous Showing results 1 — 15 out of 315 results