Advertisement

Questions of decidability for context-free chain code picture languages

  • Friedheld Hinz
Chapter 1 Languages
  • 101 Downloads
Part of the Lecture Notes in Computer Science book series (LNCS, volume 381)

Abstract

A picture description is a word over the alphabet {u,d,r,l,↑↓} with the following interpretation: "move one unit line up (down, right, left, resp.) from the current point" for letter u (d,r,l, resp.) and "lift (sink) the pen" for ↑ (↓). The set of unit lines traversed with sunk pen is the picture described. A set of pictures given by a set of picture descriptions generated by a context-free grammar is called a context-free (chain code) picture language.

We show that the membership problem and the superpicture problem are undecidable for context-free and for linear context-free picture languages, while the subpicture problem is decidable. This result is in contrast to the situation for regular picture languages and for context-free picture languages generated without using a "lift the pen"-symbol. For these classes all three problems are known to be decidable, and the subpicture problem is harder than the superpicture problem (NP-complete instead of polynomial time).

Keywords

Turing Machine Final Rule Chain Code Membership Problem Unit Line 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Rosenfeld, A.: Picture Languages — Formal Models of Picture Recognition, Academic Press, London (1979).Google Scholar
  2. [2]
    Freeman, H.: Computer Processing of Line-Drawing Images, Comput. Surveys 6 (1974), 57–97.Google Scholar
  3. [3]
    Kim, C. and Sudborough, I.H.: The Membership and Equivalence Problems for Picture Languages, TCS 52 (1987), 177–192.Google Scholar
  4. [4]
    Maurer, H.A., Rozenberg, G., Welzl, E.: Using String Languages to Describe Picture Languages, Inform. and Contr. 54 (1982), 155–185.Google Scholar
  5. [5]
    Minsky, M.L.: Recursive Unsolvability of Post's Problem of "Tag" and other topics in Theory of Turing Machines, Annals of Mathematics 74 (1961), 437–455.Google Scholar
  6. [6]
    Mylopoulus, J.: On the Application of Formal Language and Automata Theory to Pattern Recognition, Pattern Recognition 4 (1972), 37–51.Google Scholar
  7. [7]
    Shaw, A.C.: A Formal Picture Description Scheme as a Basis for Picture Processing Systems, Inform. and Contr. 14 (1969), 9–52.Google Scholar
  8. [8]
    Sudborough, I.H. and Welzl, E: Complexity and Decidability for Chain Code Picture Languages, TCS 36 (1985), 175–202.Google Scholar
  9. [9]
    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
  10. [10]
    Hinz, F: doctoral thesis (in German), in preparation.Google Scholar
  11. [11]
    Kim, C.: Complexity and Decidability for Restricted Classes of Picture Languages, to appear in TCS.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • Friedheld Hinz
    • 1
  1. 1.RWTH Aachen, Lehrstuhl für Informatik IIAachenFRG

Personalised recommendations