Abstract
An abstract notion of context-free grammar is introduced. It deals with abstract objects that can be words, trees, graphs or other combinatorial objects. It is applied to NLC graph grammars introduced by Rozenberg and Janssens. The monadic second-order theory of a context-free NLC set of graphs is decidable.
Notes+Formation associée au C N R S
(1) The author's address on the UUCP electronic mail network is mcvax ! inria ! geocub ! courcell
(2) This text is an excerpt of a paper with same title to appear in Theoretical Computer Science vol.55.For the reader's convenience the numbering of the full paper has been kept.
(3) This work has been supported by the "Programme de Recherches Coordonnées, Mathématiques et Informatique".
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
BAUDERON M., COURCELLE B., Graph expressions and graph rewritings, to appear in Mathematical Systems Theory.
COURCELLE B., Equivalences and transformations of regular systems. Applications to recursive program schemes and grammars, Theor.Comp.Sci. 46 (1986), 1–122.
COURCELLE B.,Recognizability and monadic second order definability for sets of finite graphs, Research report 8634 Bordeaux I University, 1986.Submitted for publication.
COURCELLE B.,On context-free sets of graphs and their monadic second order theory,Proceedings of the 3rd international workshop on graph-grammars,Lec.NotesComput.Sci.1987, to appear.
ENGELFRIET J., SCHMIDT E.,IO and OI,J.Comput.Systems Sci., 15 (1977) 328–353 and 16 (1978) 67–99.
GINSBURG S., RICE, Two families of languages related to ALGOL, JACM 9 (1962) 350–371.
HABEL A. and KREOWSKI H.J, Some structural aspects of hypergraph languages generated by hyperedge replacements, Preprint, October 1985. Proc. STACS 1987. L.N.C.S. (Springer) vol.247,pp.207–219
JANSSENS D.,ROZENBERG G.,Decision problems for NLC grammars, J.Comput.Syst.Sci.22 (1981) 144–177.
JANSSENS D.,ROZENBERG G., A survey of NLC grammars, in Proc. of CAAP' 83,L'Aquila, Lect. Notes in Comp. Sci. 159, Springer 1983, 114–128.
JANSSENS D., ROZENBERG G., Neighborhood uniform NLC grammars Computer vision, graphics and image processing 36 (1986 131–151.
MEZEI J., WRIGHT J., Algebraic automata and context-free sets, Information and control 11 (1967) 3–29.
ROZENBERG G., WELZL E., Graph Theoretic closure properties of the Family of Boundary NLC graph languages, Acta informatica, 23 (1986) 289–309.
ROZENBERG G., WELZL E., Boundary NLC grammars-Basic definitions normal forms and complexity, Information and control 69 (1986) 136–167.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Courcelle, B. (1988). An axiomatic definition of context-free rewriting and its application to NLC graph grammars. In: Cori, R., Wirsing, M. (eds) STACS 88. STACS 1988. Lecture Notes in Computer Science, vol 294. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0035848
Download citation
DOI: https://doi.org/10.1007/BFb0035848
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-18834-6
Online ISBN: 978-3-540-48190-4
eBook Packages: Springer Book Archive