A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Decision problems and regular chain code picture languages
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
doi:10.1016/0166-218x(93)90138-e
fatcat:optjecww4jhwnjxhfyajls3yne