On regular drawn symbolic picture languages

Drawn symbolic pictures are an extension of drawn pictures obtained by associating a symbol from an alphabet to each point of the picture. In the paper we will address some new interesting issues derived from the introduction of the symbols and we will identify the conditions, which ensure the preservation of properties holding for drawn pictures in the setting of the proposed extension.

[1]  Filomena Ferrucci,et al.  Symbolic Picture Languages and their Decidability and Complexity Properties , 1999, J. Vis. Lang. Comput..

[2]  Jacques Sakarovitch.  Description des monoïdes de type fini , 1981, J. Inf. Process. Cybern..

[3]  Jerome Feder,et al.  Plex languages , 1971, Inf. Sci..

[4]  Grzegorz Rozenberg,et al.  Chain code picture languages , 1982, Graph-Grammars and Their Application to Computer Science.

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

[6]  Denis Robilliard,et al.  Undecidability of existential properties in picture languages , 2000, Theor. Comput. Sci..

[7]  Jürgen Dassow,et al.  Efficient Reductions of Picture Words , 1993, RAIRO Theor. Informatics Appl..

[8]  Herbert Freeman,et al.  On the Encoding of Arbitrary Geometric Configurations , 1961, IRE Trans. Electron. Comput..

[9]  Arto Salomaa,et al.  Formal languages , 1973, Computer science classics.

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

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

[12]  Jacques Sakarovitch,et al.  Easy Multiplications II. Extensions of Rational Semigroups , 1990, Inf. Comput..

[13]  Ivan Hal Sudborough,et al.  Leftmove-bounded picture languages , 2000, Theor. Comput. Sci..

[14]  Changwook Kim.  Unambiguous Description of Chain Code Picture Languages , 1996, Inf. Process. Lett..

[15]  Azriel Rosenfeld,et al.  Picture languages: Formal models for picture recognition , 1979 .

[16]  Jean Berstel,et al.  Transductions and context-free languages , 1979, Teubner Studienbücher : Informatik.

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

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

[19]  Ivan Hal Sudborough,et al.  On Reversal-Bounded Picture Languages , 1992, Theor. Comput. Sci..

[20]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[21]  Karel Culik,et al.  Two Way Finite State Generators , 1983, FCT.

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

[23]  Changwook Kim.  Retreat Bounded Picture Languages , 1994, Theor. Comput. Sci..

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