Abstract
A word on alphabet π={u, r, d, l} can be thought of as a description of a connected picture drawn on a square grid: each letter is associated with a unit move of a pen, u coding a move up, r, d and l coding moves to the right, down and to the left. We define the notion of superposition of two pictures f and g as the set of pictures obtained when one draws first f and then g with the sole constraint that the resulting picture must be connected. We show that superposition does not preserve regularity of classical chain-code picture languages, as defined by Maurer and al. [12]. On the other hand, we prove, using constructive methods, that regular descriptive ”branch-picture” languages, introduced by Gutbrod.
This research was partially supported by “GDR Mathématiques et Informatique” and ESPRIT Basic Research Action 6317 ASMICS 2
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Danièle Beauquier. An undecidable problem about rationnal sets and contour words of polyominoes. Information Processing Letters, 37:257–263, 1991.
Danièle Beauquier, Michel Latteux, and Karine Slowinski. A decidability result about convex polyominoes. In Lecture Notes in Computer Science, volume 583, pages 32–45, 1992.
Danièle Beauquier and Maurice Nivat. Tiling pictures of the plane with two bars, a horizontal and a vertical one. Technical Report LITP 91.67, LITP, November 1991.
Franz J. Brandenburg and Jürgen Dassow. Efficient reductions of picture words. Theoretical Informatics and Applications, 27(4):49–56, 1993.
Jürgen Dassow. Graph-theoretical properties and chain code picture languages. J. Inf. Process. Cybern., EIK 25:423–433, 1989.
Jürgen Dassow. On the connectedness of pictures in chain code picture languages. Theoretical Computer Science, 81:289–294, 1991.
H. Freeman. On the encoding of arbitrary geometric configuration. Ire Transactions on Electronic Computers, 10:260–268, 1961.
Roger Gutbrod. Branch picture languages. Technical report, Aachen University, 1991.
Friedhelm Hinz and Emo Welzl. Regular chain code picture languages with invisible lines. Technical Report 252, Graz University of Technology, 1988.
Changwook Kim. Complexity and decidability for restricted classes of picture languages. Theoretical Computer Science, 73, 1990.
Changwook Kim and Ivan Hal Sudborough. On reversal-bounded picture languages. Theoretical Computer Science, 104:185–206, 1992.
H. A. Maurer, G. Rozenberg, and E. Welzl. Using string languages to describe picture languages. Information and Control, 54:155–185, 1982.
Gheorge Păun, Denis Robilliard, and Karine Slowinski. Connected pictures and minimal words with blank moves. Technical Report IT-92-239, LIFL, Université des Sciences et Technologies de Lille, France, November 1992.
Patrice Séébold and Karine Slowinski. The shortest way to draw a connected picture. Computer Graphics Forum, 10:319–327, 1991.
Jihad Tatari and Eric Tosan. Représentation des polyominos. In Actes de GROPLAN'92, 1992.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ratoandromanana, B., Robilliard, D. (1994). Superposition in picture languages. In: Tison, S. (eds) Trees in Algebra and Programming — CAAP'94. CAAP 1994. Lecture Notes in Computer Science, vol 787. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0017491
Download citation
DOI: https://doi.org/10.1007/BFb0017491
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57879-6
Online ISBN: 978-3-540-48373-1
eBook Packages: Springer Book Archive