Regular expressions and context-free grammars for picture languages

  • Oliver Matz
Automata Theory II
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1200)


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.


formal languages pictures languages grammars regular expressions 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [GR92]
    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.Google Scholar
  2. [GR96]
    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.Google Scholar
  3. [GRST96]
    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.CrossRefGoogle Scholar
  4. [Mat95]
    Oliver Matz. Klassifizierung von Bildsprachen mit rationalen Ausdrücken, Grammatiken und Logik-Formeln. Diploma thesis, Christian-Albrechts-Universität Kiel, 1995. (German).Google Scholar
  5. [Sir87]
    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.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Oliver Matz
    • 1
  1. 1.Institut für Informatik und Praktische MathematikChristian-Albrechts-UnivertitätKiel

Personalised recommendations