Abstract
We introduce a new concept of regular expression and context-free grammar for picture languages (sets of matrices over a finite alphabet) and compare and connect these two formalisms.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
D. Giammarresi and A. Restivo. Recognizable picture languages. In Proceedings First International Colloqium on Parallel Image Processing 1991, number 6 in International Journal Pattern Recognition and Artificial Intelligence, pages 241–256, 1992.
D. Giammarresi and A. Restivo. Two-dimensional languages. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Language Theory, volume III. Springer-Verlag, New York, 1996.
D. Giammarresi, A. Restivo, S. Seibert, and W. Thomas. Monadic second-order logic and recognizability by tiling systems. Information and Computation, 125:32–45, 1996.
Oliver Matz. Klassifizierung von Bildsprachen mit rationalen Ausdrücken, Grammatiken und Logik-Formeln. Diploma thesis, Christian-Albrechts-Universität Kiel, 1995. (German).
R. Siromoney. Advances in array languages. In Ehrig et al., editors, Graph Grammars and Their Applications to Computer Science, volume 291 of Lecture Notes in Computer Science, pages 549–563. Springer-Verlag, 1987.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Matz, O. (1997). Regular expressions and context-free grammars for picture languages. In: Reischuk, R., Morvan, M. (eds) STACS 97. STACS 1997. Lecture Notes in Computer Science, vol 1200. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0023466
Download citation
DOI: https://doi.org/10.1007/BFb0023466
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62616-9
Online ISBN: 978-3-540-68342-1
eBook Packages: Springer Book Archive