Abstract
Regular chain-code picture languages can be generated by collage grammars. As a consequence, all undecidability results known for regular chain-code languages can be adapted to picture languages generated by collage grammars.
This work was partially supported by the Deutsche Forschungsgemeinschaft and the ESPRIT Basic Research Working Group No. 7183: Computing by Graph Transformation (COMPUGRAPH II).
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 undecidability problem about rational sets and contour words of polyominoes. Information Processing Letters 37, 257–263, 1991.
Claude Berge. Graphs and Hypergraphs. North Holland, Amsterdam, 1973.
H.S.M. Coxeter. Introduction to Geometry. Wiley Classics Library Edition, John Wiley & Sons, Inc., New York, second edition edition, 1989.
Jürgen Dassow, Friedhelm Hinz. Decision problems and regular chain code picture languages. Discrete Applied Mathematics 45, 29–49, 1993.
Frank Drewes. Language theoretic and algorithmic properties of collages and pattern living in a grid. Journal of Computer and System Sciences, 1995. To appear.
Frank Drewes, Annegret Habel, Hans-Jörg Kreowski, Stefan Taubenberger. Generating self-affine fractals by collage grammars. Theoretical Computer Science 145, 159–187, 1995.
Frank Drewes, Hans-Jörg Kreowski. (Un-)decidability of geometric properties of pictures generated by collage grammars. Fundamenta Informaticae, 1995. To appeal.
Simant Dube. Fractal geometry, turing machines and divide-and-conquer recurrences. RAIRO Theoretical Informatics and Applications 28, 405–423, 1994.
Annegret Habel, Hans-Jörg Kreowski. Pretty patterns produced by hyperedge replacement. In H. Göttler, H.J. Schneider, eds., Graph-Theoretic Concepts in Computer Science, Lecture Notes in Computer Science 314, 32–5, 1988.
Annegret Habel, Hans-Jörg Kreowski. Collage grammars. In H. Ehrig, H.-J. Kreowski, G. Rozenberg, eds., Graph Grammars and Their Application to Computer Science, Lecture Notes in Computer Science 532, 411–429, 1991.
Annegret Habel, Hans-Jörg Kreowski, Stefan Taubenberger. Collages and patterns generated by hyperedge replacement. Languages of Design 1, 125–145, 1993.
John E. Hopcroft, Jeffrey D. Ullman. Introduction to Automata Theory, Languages and Compuation. Addison-Wesley, Reading, Mass., 1979.
Changwook Kim. Complexity and decidability for restricted classes of picture languages. Theoretical Computer Science 73, 295–311, 1990.
Hermann A. Maurer, Grzegorz Rozenberg, Emo Welzl. Using string languages to describe picture languages. Information and Control 54, 155–185, 1982.
Denis Robilliard. Undecidable questions in picture languages. Technical Report IT 262, Université de Lille, 1994.
Ivan Hal Sudborough, Emo Welzl. Complexity and decidability for chain code picture languages. Theoretical Computer Science 36, 173–202, 1985.
Stefan Taubenberger. Correct translations of generalized iterated function systems to collage grammars. Technical Report 7/94, Bremen, 1994.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dassow, J., Habel, A., Taubenberger, S. (1996). Chain-code pictures and collages generated by hyperedge replacement. In: Cuny, J., Ehrig, H., Engels, G., Rozenberg, G. (eds) Graph Grammars and Their Application to Computer Science. Graph Grammars 1994. Lecture Notes in Computer Science, vol 1073. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61228-9_102
Download citation
DOI: https://doi.org/10.1007/3-540-61228-9_102
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61228-5
Online ISBN: 978-3-540-68388-9
eBook Packages: Springer Book Archive