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

  • Friedhelm Hinz
Contributed Papers Structures

DOI: 10.1007/BFb0028979

Part of the Lecture Notes in Computer Science book series (LNCS, volume 349)
Cite this paper as:
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

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1989

Authors and Affiliations

  • Friedhelm Hinz
    • 1
    • 2
  1. 1.RWTH AachenAachenWestern Germany
  2. 2.the Institutes for Information ProcessingGraz University of TechnologyGrazAustria

Personalised recommendations