Algebraic picture generation based on a pixel deformation theory is presented. The main tool used is the deformation monoid which simulates the algebraic structure of pictures viewed as rectangular arrays with operations the horizontal and vertical concatenation. Picture languages generated by grammatical systems are considered and a Chomsky-like normal form as well as an iteration lemma are established. Infinite pictures are obtained as the ω-completion of the set of finite pictures ordered by picture refinement. Regular fractal pictures (such as the Sierpinski Carpet, the Cantor dust, etc.) are defined as the components of the least solution of systems whose right hand side members are finite pictures. They constitute the least class of pictures containing the finite pictures and closed under substitution and the self similarity operation. Solving non deterministic picture program schemes we get the so called ∞-refinement languages which consist of finite and infinite pictures. For such languages the emptiness and finiteness problems are decidable.
KeywordsRectangular Array Deformation Operator Picture Deformation Substitution Operation Commutative Semiring
Unable to display preview. Download preview PDF.
- 1.Bardohl, R., Minas, M., Schurr, A., Taentzer, G.: Application of graph transformations for visual, languages. Handbook of Graph Grammars and Computing by Graph Tranformation, vol. 2, pp. 105–180. World Scientific, Singapore (1999)Google Scholar
- 5.Courcelle, B.: Recursive Applicative program schemes. Handbook of Theoretical Computer Science, Formal Models and Semantics, vol. B, pp. 459-492. Elsevier, Amsterdam (1990)Google Scholar
- 6.II Culik, K., Kari, J.: Digital images and formal languages. Handbook of Formal Languages, vol. 3, pp. 599–616. Springer, Berlin (1997)Google Scholar
- 7.Culik, K., Kari, J.: Finite state transformations of images, automata, languages and programming (Szeged, 1995), Lecture Notes in Computer Science, vol. 944, pp. 51–62. Springer, Berlin (1995)Google Scholar
- 8.II Culik, K., Kari, J.: Image compression using weighted finite automata. Mathematical Foundations of Computer Science (Gdańsk, 1993), Lecture Notes in Computer Science, vol. 711, pp. 392–402. Springer, Berlin (1993)Google Scholar
- 9.Drews F. (2006). Grammatical Picture Generation, A Tree-Based Approach. Springer, Berlin Google Scholar
- 11.Giammarresi D. and Restivo A. (1997). Two-dimensional languages. In: Rozenberg, G. and Salomaa, A (eds) Handbook of Formal Languages, Beyond Words, vol 3, pp 215–267. Springer, Berlin Google Scholar
- 13.Kuich W. and Salomaa A. (1986). Semirings, automata, languages. EATCS Monographs on Theoretical Computer Science, vol. 5. Springer, Heidelberg Google Scholar
- 14.Matz, O.: Regular expressions and context-free grammars for picture languages. In: STACS’97 Proceedings, LNCS, vol. 1200, pp. 283–294. Springer, Heidelberg (1997)Google Scholar
- 22.Wechler W. (1992). Universal algebra, EATCS Monographs on Theoretical Computer Science, vol. 10. Springer, Berlin Google Scholar