Skip to main content
Article thumbnail
Location of Repository

Undecidability of existential properties in picture languages

By D. Robilliard and D. Simplot


We are interested in description of set of pictures by string languages by using several semantics: segments [12], segments with blank moves [8] and pixels [10]. We give a method to code the Post correspondence problem in rational picture languages in order to show the undecidability of existence of words satisfying a given property in a rational language

Year: 1998
OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.