Advertisement

The membership problem for context-free chain code picture languages

  • Friedhelm Hinz
Communications
Part of the Lecture Notes in Computer Science book series (LNCS, volume 452)

Abstract

The membership problem of context-free chain code picture languages is shown to be NP-complete. We develope techniques to make our NP-algorithm deterministic in special cases. Especially, we derive efficient algorithms for languages closed under superpicture and for three-way picture languages.

Keywords

Regular Language Membership Problem Attribute Grammar Standard Representative Monoid Homomorphism 
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.

Literatur

  1. [Hi 1]
    F. Hinz, Erzeugung von Bildsprachen durch Chomsky-Grammatiken — Entscheidbarkeits-und Komplexitätsfragen, Dissertation (Ph.D.-Thesis), RWTH Aachen.Google Scholar
  2. [Hi 2]
    F. Hinz, The Equivalence Problem for Three-Way Picture Languages, Manuskript (1988).Google Scholar
  3. [Ki]
    C. Kim, Complexity and decidability for restricted classes of picture languages, to appear in Theoretical Computer Science.Google Scholar
  4. [KS]
    C. Kim, I.H. Sudborough, The membership and equivalence problem for picture languages, Theoretical Computer Science 52 (1987), 177–191.Google Scholar
  5. [Kn]
    D.E. Knuth, Semantics of Context-Free Languages, Mathematical Systems Theory 2:2 (1968), 127–145. Errata 5:1 (1971), 95–96.Google Scholar
  6. [MRW]
    H.A. Maurer, G. Rozenberg und E. Welzl, Using String Languages to Describe Picture Languages, Information and Control 54 (1982), 155–185.Google Scholar
  7. [My]
    J. Mylopoulus, On the Application of Formal Language and Automata Theory to Pattern Recognition, Pattern Recognition 4 (1972), 37–51.Google Scholar
  8. [SW]
    I.H. Sudborough, E. Welzl, Complexity and Decidability for Chain Code Picture Languages, Theoretical Computer Science 36 (1985), 173–202.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1990

Authors and Affiliations

  • Friedhelm Hinz
    • 1
  1. 1.Lehrstuhl Informatik II, RWTH AachenGermany

Personalised recommendations