Abstract
Several classical models of picture grammars based on array rewriting rules can be unified and extended by a tiling based approach. The right part of a rewriting rule is formalized by a finite set of permitted tiles. We focus on a simple type of tiling, named regional, and define the corresponding regional tile grammars. They include both Siromoney’s (or Matz’s) Kolam grammars, and their generalization by Průša. Regionally defined pictures can be recognized with polynomial time complexity by an algorithm extending the CKY one for strings. Regional tile grammars and languages are strictly included into the tile grammars and languages, and are incomparable with Giammarresi-Restivo tiling systems (or Wang’s tilings).
Work Partially Supported by ESF Automata: from Mathematics to Applications (AutoMathA).
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
Allauzen, C., Durand, B.: Tiling problems. In: Borger, E., Gradel, E. (eds.) The classical decision problem. Springer, Heidelberg (1997)
Crespi Reghizzi, S., Pradella, M.: Tile Rewriting Grammars and Picture Languages. Theoretical Computer Science 340(2), 257–272 (2005)
Crespi Reghizzi, S., Pradella, M.: A CKY parser for picture grammars. Information Processing Letters 105(6), 213–217 (2008)
Giammarresi, D., Restivo, A.: Recognizable picture languages. International Journal Pattern Recognition and Artificial Intelligence 6(2-3), 241–256; Special Issue on Parallel Image Processing (1992)
Giammarresi, D., Restivo, A.: Two-dimensional languages. In: Salomaa, A., Rozenberg, G. (eds.) Handbook of Formal Languages, vol. 3, pp. 215–267. Springer, Berlin (1997)
Lewis, H.: Complexity of solvable cases of the decision problem for predicate calculus. In: Proc. 19th Symposium on Foundations of Computer Science, pp. 35–47 (1978)
Matz, O.: Regular expressions and context-free grammars for picture languages. In: 14th Annual Symposium on Theoretical Aspects of Computer Science. LNCS, vol. 1200, pp. 283–294 (1997)
Průša, D.: Two-dimensional languages (PhD Thesis) (2004)
Simplot, D.: A characterization of recognizable picture languages by tilings by finite sets. TCS: Theoretical Computer Science 218 (1999)
Siromoney, G., Siromoney, R., Krithivasan, K.: Abstract families of matrices and picture languages. Computer Graphics and Image Processing 1 (1972)
Siromoney, G., Siromoney, R., Krithivasan, K.: Picture languages with array rewriting rules. Information and Control 23(5), 447–470 (1973)
Younger, D.H.: Recognition of context-free languages in time n 3. Information and Control 10(2), 189–208 (1967)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cherubini, A., Crespi Reghizzi, S., Pradella, M. (2008). Regional Languages and Tiling: A Unifying Approach to Picture Grammars. In: Ochmański, E., Tyszkiewicz, J. (eds) Mathematical Foundations of Computer Science 2008. MFCS 2008. Lecture Notes in Computer Science, vol 5162. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85238-4_20
Download citation
DOI: https://doi.org/10.1007/978-3-540-85238-4_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-85237-7
Online ISBN: 978-3-540-85238-4
eBook Packages: Computer ScienceComputer Science (R0)