Decision Problems and Regular Chain Code Picture Languages

Abstract By interpretation of the letters u, d, r, l, ↑, ↓ as “move u p, ( d own, r ight, l eft)” 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 discuss the decidability status of the following problems for regular and context-free picture languages: • Is 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?

[1]  Ivan Hal Sudborough,et al.  The Membership and Equivalence Problems for Picture Languages , 1987, Theor. Comput. Sci..

[2]  Danièle Beauquier.  An Undecidable Problem About Rational Sets and Contour Words of Polyominoes , 1991, Inf. Process. Lett..

[3]  Changwook Kim.  Picture Iteration and Picture Ambiguity , 1990, J. Comput. Syst. Sci..

[4]  Friedhelm Hinz.  Classes of Picture Languages that Cannot be Distinguished in the Chain Code Concept and Deletion of Redundant Retreats , 1989, STACS.

[5]  Claude Berge.  Theory of graphs and its applications , 1962 .

[6]  Michel Latteux,et al.  A Decidability Result about Convex Polyominoes , 1992, LATIN.

[7]  Grzegorz Rozenberg,et al.  Using String Languages to Describe Picture Languages , 1982, Inf. Control..

[8]  Jürgen Dassow.  On the Connectedness of Pictures in Chain Code Picture Languages , 1991, Theor. Comput. Sci..

[9]  Changwook Kim.  Complexity and Decidability for Restricted Classes of Picture Languages , 1990, Theor. Comput. Sci..

[10]  Ivan Hal Sudborough,et al.  Complexity and Decidability for Chain Code Picture Languages , 1985, Theor. Comput. Sci..

[11]  Jürgen Dassow.  Graph-theoretical Properties and Chain Code Picture Languages , 1989, J. Inf. Process. Cybern..

[12]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[13]  Seymour Ginsburg,et al.  The mathematical theory of context free languages , 1966 .

[14]  Jürgen Dassow,et al.  A undecidability result for regular anguages and its applications to regulated rewriting , 1989, Bull. EATCS.

[15]  Herbert Freeman,et al.  Computer Processing of Line-Drawing Images , 1974, CSUR.

[16]  Gheorghe Paun,et al.  Regulated Rewriting in Formal Language Theory , 1989 .

[17]  Jean-Camille Birget.  Basic techniques for two-way finite automata , 1988, Formal Properties of Finite Automata and Applications.