Skip to main content
SpringerLink
Log in

Chain code picture languages

  • Conference paper
  • First Online:
Graph-Grammars and Their Application to Computer Science (Graph Grammars 1982)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 153))

Abstract

A picture is a connected set of axis parallel unit lines from the Cartesian plane considered as a square grid. A word over the alphabet {l,r,u,d} is a picture description in the sense that it represents a traversal of a picture where the interpretation of the symbols l,r,u,d is: l — go (and draw) one unit line to the left of the current point; r,u, and d are interpreted analogously with “left” replaced by “right”, “up”, and “down”, respectively. This is one of the chain codemodels.

A set of picture descriptions forms a picture description language.

We investigate the basic properties of pictures and picture description languages from the formal language theory point of view. The results presented are concerned with the basic Chomsky hierarchy of picture description languages, basic decision problems and the complexity of pictures.

The study should result in a better insight into the mathematical structure of picture languages generated by string grammars from the Chomsky hierarchy.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abelson,H. and diSessa, A., Turtle Geometry, MIT Press (1980).

    Google Scholar 

  2. Freeman, H., On encoding arbitrary geometric configurations, IRE Trans. EC 10 pp. 260–268 (1961).

    Google Scholar 

  3. Freeman, H., Computer processing of line-drawing images, Computing Surveys 6 pp. 57–97 (1974).

    Google Scholar 

  4. Feder, J., Languages of encoded line patterns, Inform. and Control 13 pp.230–244 (1968).

    Google Scholar 

  5. Ginsburg, S., The Mathematical Theory of Context-free Languages, McGraw Hill, New York (1966).

    Google Scholar 

  6. Harrison, M., Introduction to Formal Language Theory, Addison Wesley, Reading, Mass. (1978).

    Google Scholar 

  7. Maurer, H., Rozenberg, G., and Welzl, E., Picture description languages, Institutes for Information Processing, Techn. University Graz, Report F83 (1982).

    Google Scholar 

  8. Salomaa, A., Formal Languages, Academic Press, London (1973).

    Google Scholar 

  9. Welzl, E., Regular picture languages: optimality and oi-interpretations, Manuscript, Institutes for Information Processing, Techn. University Graz, (1982).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institutes for Information Processing, Technical University of Graz, A-8010, Graz, Austria

    Hermann A. Maurer & Emo Welzl

  2. Department of Mathematics, University of Leiden, 2300, R A Leiden, The Netherlands

    Grzegorz Rozenberg

Authors
  1. Hermann A. Maurer
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Grzegorz Rozenberg
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Emo Welzl
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Hartmut Ehrig Manfred Nagl Grzegorz Rozenberg

Rights and permissions

Reprints and permissions

Copyright information

© 1983 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Maurer, H.A., Rozenberg, G., Welzl, E. (1983). Chain code picture languages. In: Ehrig, H., Nagl, M., Rozenberg, G. (eds) Graph-Grammars and Their Application to Computer Science. Graph Grammars 1982. Lecture Notes in Computer Science, vol 153. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0000110

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-12310-1

  • Online ISBN: 978-3-540-39897-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation