Skip to main content
SpringerLink
Log in

Classes of picture languages that cannot be distinguished in the chain code concept and deletion of redundant retreats

  • Contributed Papers
  • Conference paper
  • First Online:
STACS 89 (STACS 1989)

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

Included in the following conference series:

Abstract

Maurer, Rozenberg and Welzl showed that every recursively enumerable chain code picture language is described by a context-sensitive string language. We show that every regular picture language is described star-free and every context-free picture language is described deterministic. We investigate closure properties of language classes concerning deletion of redundant retreats and thereby establish a normal form for regular picture languages.

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. Dassow, J., private communication, Magdeburg (1988).

    Google Scholar 

  2. Freeman, H.: Computer Processing of Line-Drawing Images, Comput. Surveys 6 (1974), 57–97.

    Google Scholar 

  3. Gutbrod, R.: Chain Code Picture Languages, Diplomarbeit, Wuerzburg, (1988).

    Google Scholar 

  4. Harrison, M.A.: Introduction to Formal Language Theory, Addison Wesley Publishing Company, London (1978).

    Google Scholar 

  5. Hinz, F.: Bildsprachen von nichtlinearer Beschreibungskomplexitaet, Diplomarbeit, RWTH Aachen (1986).

    Google Scholar 

  6. Hinz, F.: Dissertation, in preparation.

    Google Scholar 

  7. Hinz, F. and Welzl, E.: Regular Chain Code Picture Languages with Invisible Lines, Graz University of Technology, Institute fuer Informationsverarbeitung, Report 252 (1988).

    Google Scholar 

  8. Korenjak, A.J. and Hopcroft, J.E.: Simple Deterministic Languages, IEEE Seventh Ann. Symp. on Switching and Automata Theory (1966), 36–46.

    Google Scholar 

  9. Maurer, H.A., Rozenberg, G., Welzl, E.: Using String Languages to Describe Picture Languages, Inform. and Contr. 54 (1982), 155–185.

    Google Scholar 

  10. McNaughton, R. and Papert, S.: Counter-Free Automata, MIT-Press, Cambridge, Mass. (1971).

    Google Scholar 

  11. Rosenfeld, A.: Picture Languages — Formal Models of Picture Recognition, Academic Press, London (1979).

    Google Scholar 

  12. Rabin, M.O. and Scott, D.: Finite Automata and Their Decision Problems, IBM Journal of Research and Development 3 (1959), 114–125.

    Google Scholar 

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

    Google Scholar 

  14. Shaw, A.C.: A Formal Picture Description Scheme as a Basis for Picture Processing Systems, Inform. and Contr. 14 (1969).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. RWTH Aachen, Lehrstuhl Informatik II, Ahornstr. 55, 5100, Aachen, Western Germany

    Friedhelm Hinz

  2. the Institutes for Information Processing, Graz University of Technology, Schieszstattgasse 4a, 8010, Graz, Austria

    Friedhelm Hinz

Authors
  1. Friedhelm Hinz
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

B. Monien R. Cori

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hinz, F. (1989). Classes of picture languages that cannot be distinguished in the chain code concept and deletion of redundant retreats. In: Monien, B., Cori, R. (eds) STACS 89. STACS 1989. Lecture Notes in Computer Science, vol 349. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0028979

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-50840-3

  • Online ISBN: 978-3-540-46098-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation