Decision problems and regular chain code picture languages

Jürgen Dassow, Friedhelm Hinz
1993 Discrete Applied Mathematics  
Dassow, J. and F. Him, Decision problems and regular chain code picture languages, Discrete Applied Mathematics 45 (1993) 2949. By interpretation of the letters U, d, r, /, t. 1 as "move up, (down, Light, left)" with the pen, "lift" and "sink" the pen of a plotter we can associate a picture with a word. The set of pictures associated with the words in a regular (context-free) string language is called a regular (context-free) picture language or chain code picture language. In this paper we
more » ... uss the decidability status of the following problems for regular and context-free picture languages: 1s some picture a subpicture of all pictures of the language? Does the language contain a picture with a given property? ~-Have all pictures of the language a given property?
doi:10.1016/0166-218x(93)90138-e fatcat:optjecww4jhwnjxhfyajls3yne