Abstract
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.
This work was possible for the first author thanks to the grant 2002CAJAL-BURV4, provided by the University Rovira i Virgili. The third author’s research was partially supported by the EC Research Training Network SegraVis (Syntactic and Semantic Integration of Visual Modeling Techniques) and by the Collaborative Research Centre 637 (Autonomous Cooperating Logistic Processes: A Paradigm Shift and Its Limitations) funded by the German Research Foundation (DFG). The fourth author acknowledges the financial support provided through the European Community’s Human Potential Programme under contract HPRN-CT- 2002-00275, SegraVis and by the grants from the Hungarian National Foundation for Scientific Research (OTKA F043090 and T049409).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Păun, G.: Marcus Contextual Grammars. Kluwer Academic Publishers, Norwell (1997)
Kudlek, M., Martín-Vide, C., Mateescu, A., Mitrana, V.: Contexts and the concept of mild context-sensitivity. Linguistics and Philosophy (26), 703–725 (2002)
Marcus, S., Păun, G., Martín-Vide, C.: Contextual grammars as generative models of natural languages. Comput. Linguist. 24(2), 245–274 (1998)
Kappes, M.: Combining contextual grammars and tree adjoining grammars. Grammars, A Journal of Mathematical Research on Formal and Natural Languages 3(2-3), 175–187 (2000)
Habel, A.: Hyperedge Replacement: Grammars and Languages. LNCS, vol. 643. Springer, Heidelberg (1992)
Drewes, F., Kreowski, H.J., Habel, A.: Hyperedge replacement graph grammars. In: Handbook of graph grammars and computing by graph transformation: vol. I, foundations, pp. 95–162. World Scientific Publishing, Singapore (1997)
Corradini, A., Montanari, U., Rossi, F., Ehrig, H., Heckel, R., Löwe, M.: Algebraic approaches to graph transformation. Part I: basic concepts and double pushout approach, pp. 163–245. World Scientific, River Edge (1997)
Courcelle, B.: The expression of graph properties and graph transformations in monadic second-order logic. In: Rozenberg, G. (ed.) Handbook of graph grammars and computing by graph transformations, vol. 1: Foundations, pp. 313–400. World Scientific, New-Jersey, London (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dediu, AH., Klempien-Hinrichs, R., Kreowski, HJ., Nagy, B. (2006). Contextual Hypergraph Grammars – A New Approach to the Generation of Hypergraph Languages. In: Ibarra, O.H., Dang, Z. (eds) Developments in Language Theory. DLT 2006. Lecture Notes in Computer Science, vol 4036. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11779148_30
Download citation
DOI: https://doi.org/10.1007/11779148_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-35428-4
Online ISBN: 978-3-540-35430-7
eBook Packages: Computer ScienceComputer Science (R0)