论文信息 - Contextual Hypergraph Grammars - A New Approach to the Generation of Hypergraph Languages

Contextual Hypergraph Grammars - A New Approach to the Generation of Hypergraph Languages

In this paper, we introduce contextual hypergraph grammars, which generalize the total contextual string grammars. We study the position of the class of languages generated by contextual hypergraph grammars in comparison with graph languages generated by hyperedge replacement grammars and double-pushout hypergraph grammars. Moreover, several examples show the potential of the new class of grammars.

Hans-Jörg Kreowski | Benedek Nagy | Adrian-Horia Dediu | Renate Klempien-Hinrichs

[1] A. Mateescu,et al. Contexts and the Concept of Mild Context-Sensitivity , 2003 .

[2] Martin Kappes,et al. Combining Contextual Grammars and Tree Adjoining Grammars , 2000, Grammars.

[3] Reiko Heckel,et al. Algebraic Approaches to Graph Transformation - Part I: Basic Concepts and Double Pushout Approach , 1997, Handbook of Graph Grammars.

[4] Gheorghe Paun,et al. Marcus Contextual Grammars , 1994, Bull. EATCS.

[5] Carlos Martín-Vide,et al. Contextual Grammars as Generative Models of Natural Language , 1998, CL.

[6] Bruno Courcelle,et al. The Expression of Graph Properties and Graph Transformations in Monadic Second-Order Logic , 1997, Handbook of Graph Grammars.

[7] Solomon Marcus,et al. Contextual Grammars , 1969, COLING.

[8] Annegret Habel,et al. Hyperedge Replacement: Grammars and Languages , 1992, Lecture Notes in Computer Science.

[9] Annegret Habel,et al. Hyperedge Replacement, Graph Grammars , 1997, Handbook of Graph Grammars.