Abstract
Many formal models have been proposed to recognize or to generate two-dimensional words. In this paper, we focus our analysis on (regular) pure 2D context-free grammars, regional tile grammars and Průša grammars, showing that nevertheless they have been proposed as a generalization of string context free grammars their expressiveness is different. This work refines the relationship among the classes of languages generated by the above grammars and Local languages and states some considerations about closure properties of (regular) pure 2D context-free languages.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Cherubini, A., Crespi-Reghizzi, S., Pradella, M.: Regional languages and tiling: A unifying approach to picture grammars. In: Ochmański, E., Tyszkiewicz, J. (eds.) MFCS 2008. LNCS, vol. 5162, pp. 253–264. Springer, Heidelberg (2008)
Cherubini, A., Crespi-Reghizzi, S., Pradella, M., San Pietro, P.: Picture languages: Tiling systems versus tile rewriting grammars. Theor. Comput. Sci. 356(1-2), 90–103 (2006)
Crespi-Reghizzi, S., Pradella, M.: Tile rewriting grammars and picture languages. Theor. Comput. Sci. 340(1), 257–272 (2005)
Giammarresi, D., Restivo, A.: Ambiguity and complementation in recognizable two-dimensional languages. In: IFIP TCS, pp. 5–20 (2008)
Matz, O.: Regular expressions and context-free grammars for picture languages. In: Reischuk, R., Morvan, M. (eds.) STACS 1997. LNCS, vol. 1200, pp. 283–294. Springer, Heidelberg (1997)
Pradella, M., Cherubini, A., Crespi-Reghizzi, S.: A unifying approach to picture grammars. CoRR, arXiv:0910.2829 (2009)
Průša, D., Hlavác, V.: 2D context-free grammars: Mathematical formulae recognition. In: Stringology, pp. 77–89 (2006)
Průša, D.: Two-dimensional Languages. PhD thesis, Charles University, Faculty of Mathematics and Physics, Czech Republic (2004)
Siromoney, G., Siromoney, R., Krithivasan, K.: Abstract families of matrices and picture languages. Computer Graphics and Image Processing 1, 284–307 (1972)
Siromoney, G., Siromoney, R., Krithivasan, K.: Picture languages with array rewriting rules. Information and Control 23(5), 447–470 (1973)
Subramanian, K.G., Ali, R.M., Geethalakshmi, M., Nagar, A.K.: Pure 2D picture grammars and languages. Discrete Applied Mathematics 157(16), 3401–3411 (2009)
Subramanian, K.G., Nagar, A.K., Geethalakshmi, M.: Pure 2D picture grammars (P2DPG) and P2DPG with regular control. In: Brimkov, V.E., Barneva, R.P., Hauptman, H.A. (eds.) IWCIA 2008. LNCS, vol. 4958, pp. 330–341. Springer, Heidelberg (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bersani, M.M., Frigeri, A., Cherubini, A. (2011). On Some Classes of 2D Languages and Their Relations. In: Aggarwal, J.K., Barneva, R.P., Brimkov, V.E., Koroutchev, K.N., Korutcheva, E.R. (eds) Combinatorial Image Analysis. IWCIA 2011. Lecture Notes in Computer Science, vol 6636. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21073-0_21
Download citation
DOI: https://doi.org/10.1007/978-3-642-21073-0_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21072-3
Online ISBN: 978-3-642-21073-0
eBook Packages: Computer ScienceComputer Science (R0)