Skip to main content
SpringerLink
Log in

A characterization of context-free string languages by directed node-label controlled graph grammars

  • Published:
Acta Informatica Aims and scope Submit manuscript

Summary

Directed node-label controlled graph grammars (DNLC grammars) are sequential graph rewriting systems. In a direct derivation step of a DNLC grammar a single node is rewritten. Both the rewriting of a node and the embedding of a “daughter graph” in a “host graph” are controlled by the labels of nodes only. We study the use of those grammars to define string languages. In particular we provide a characterization of the class of context-free string languages in terms of DNLC grammars.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Claus, V., Ehrig, H., Rozenberg, G. (Eds.): Graph grammars and their application to computer science and biology. Lecture Notes in Computer Science Vol. 73, Berlin-Heidelberg-New York: Springer 1979

    Google Scholar 

  2. Ehrig, H.: Introduction to the algebraic theory of graph grammars. 1–69. In [1] (1979)

  3. Ehrenfeucht, A., Rozenberg, G.: The sequence equivalence problem is decidable for OS systems. J. Assoc. Comput. Mach. (in press, 1981)

  4. Janssens, D., Rozenberg, G.: Restrictions, extensions and variations of NLC grammars. Information Sci. 20, 217–244 (1980)

    Google Scholar 

  5. Nagl, M.: Graph-Grammatiken. Braunschweig/Wiesbaden: Vieweg 1979

    Google Scholar 

  6. Rosenfeld, A.: Picture languages. New York-London: Academic Press 1979

    Google Scholar 

  7. Salomaa, A.: Formal languages, New York-London: Academic Press 1973

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, University of Antwerp, U.I.A., B-2610, Wilrijk, Belgium

    D. Janssens

  2. Institute of Applied Mathematics and Computer Science, University of Leiden, 2300, RA Leiden, The Netherlands

    G. Rozenberg

Authors
  1. D. Janssens
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. G. Rozenberg
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Janssens, D., Rozenberg, G. A characterization of context-free string languages by directed node-label controlled graph grammars. Acta Informatica 16, 63–85 (1981). https://doi.org/10.1007/BF00289591

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00289591

Keywords

Search

Navigation