Abstract
We consider collage grammars whose rules subdivide the unit square into smaller and smaller rectangles. The decidability status of selected decision problems for this type of grammars is surveyed: the membership problem, the emptiness and finiteness problems, connectedness and disconnectedness of the generated pictures, and the question whether a generated collage contains a rectangle whose lower-left corner is a point on the diagonal.
Dedicated to Symeon Bozapalidis on the occasion of his retirement.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Barnsley, M.: Fractals Everywhere. Academic Press, Boston (1988)
Bauderon, M., Courcelle, B.: Graph expressions and graph rewriting. Mathematical Systems Theory 20, 83–127 (1987)
Bozapalidis, S.: Picture deformation. Acta Informatica 45, 1–31 (2008)
Dassow, J., Păun, G.: Regulated Rewriting in Formal Language Theory. EATCS Monographs in Theoretical Computer Science. Springer, Berlin (1989)
Drewes, F.: Language theoretic and algorithmic properties of d-dimensional collages and patterns in a grid. Journal of Computer and System Sciences 53, 33–60 (1996)
Drewes, F.: Tree-based generation of languages of fractals. Report 2/99, Univ. Bremen (1999); revised version appeared in Theoretical Computer Science
Drewes, F.: Tree-based picture generation. Theoretical Computer Science 246, 1–51 (2000)
Drewes, F.: Grammatical Picture Generation – A Tree-Based Approach. Texts in Theoretical Computer Science. An EATCS Series. Springer, Heidelberg (2006)
Drewes, F., Engelfriet, J.: Decidability of the finiteness of ranges of tree transductions. Information and Computation 145, 1–50 (1998)
Drewes, F., Engelfriet, J.: Branching synchronization grammars with nested tables. Journal of Computer and System Sciences 68, 611–656 (2004)
Drewes, F., Ewert, S., Klempien-Hinrichs, R., Kreowski, H.-J.: Computing raster images from grid picture grammars. Journal of Automata, Languages and Combinatorics 8, 499–519 (2003)
Drewes, F., Habel, A., Kreowski, H.-J.: Hyperedge replacement graph grammars. In: Rozenberg, G. (ed.) Handbook of Graph Grammars and Computing by Graph Transformation. Foundations, vol. 1, ch. 2, pp. 95–162. World Scientific, Singapore (1997)
Drewes, F., Kreowski, H.-J.: (Un-)decidability of geometric properties of pictures generated by collage grammars. Fundamenta Informaticae 25, 295–325 (1996)
Drewes, F., Kreowski, H.-J.: Picture generation by collage grammars. In: Ehrig, H., Engels, G., Kreowski, H.-J., Rozenberg, G. (eds.) Handbook of Graph Grammars and Computing by Graph Transformation. Applications, Languages, and Tools, vol. II, ch. 11, pp. 397–457. World Scientific, Singapore (1999)
Dube, S.: Undecidable problems in fractal geometry. Complex Systems 7, 423–444 (1993)
Dube, S.: Fractal geometry, Turing machines, and divide-and-conquer recurrences. RAIRO Theoretical Informatics and Applications 28, 405–423 (1994)
Ewert, S.: Random context picture grammars: The state of the art. In: Drewes, F., Habel, A., Hoffmann, B., Plump, D. (eds.) Manipulation of Graphs, Algebras and Pictures. Essays Dedicated to Hans-Jörg Kreowski on the Occasion of His 60th Birthday, pp. 135–147 (2009)
Ewert, S., v.d. Walt, A.P.: Random context picture grammars. Publicationes Mathematicae (Debrecen) 54 (Supp.), 763–786 (1999)
Habel, A.: Hyperedge Replacement: Grammars and Languages. LNCS, vol. 643. Springer, Heidelberg (1992)
Habel, A., Kreowski, H.-J.: May we introduce to you: Hyperedge replacement. In: Ehrig, H., Nagl, M., Rosenfeld, A., Rozenberg, G. (eds.) Graph Grammars 1986. LNCS, vol. 291, pp. 15–26. Springer, Heidelberg (1987)
Habel, A., Kreowski, H.-J.: Pretty patterns produced by hyperedge replacement. In: Göttler, H., Schneider, H.-J. (eds.) WG 1987. LNCS, vol. 314, pp. 32–45. Springer, Heidelberg (1988)
Habel, A., Kreowski, H.-J.: Collage grammars. In: Ehrig, H., Kreowski, H.-J., Rozenberg, G. (eds.) Graph Grammars 1990. LNCS, vol. 532, pp. 411–429. Springer, Heidelberg (1991)
Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading (1979)
Rosenfeld, A.: Picture Languages: Formal Models for Picture Recognition. Academic Press, New York (1979)
Rosenfeld, A., Siromoney, R.: Picture languages – a survey. Languages of Design 1, 229–245 (1993)
Ruohonen, K.: Reversible machines and Post’s correspondence problem for biprefix morphisms. EIK – Journal on Information Processing and Cybernetics 12, 579–595 (1985)
Younger, D.H.: Recognition and parsing of context-free languages in time n 3. Information and Control 10, 189–208 (1967)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Drewes, F. (2011). Selected Decision Problems for Square-Refinement Collage Grammars. In: Kuich, W., Rahonis, G. (eds) Algebraic Foundations in Computer Science. Lecture Notes in Computer Science, vol 7020. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24897-9_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-24897-9_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-24896-2
Online ISBN: 978-3-642-24897-9
eBook Packages: Computer ScienceComputer Science (R0)