The development of fast cellular pattern transformation algorithms using virtual boundaries

  • Josef Pecht
Cellular Algorithms And Their Verifications
Part of the Lecture Notes in Computer Science book series (LNCS, volume 111)


In [1,2,4] it is shown that the development of (fast) d-dimensional cellular pattern transformation algorithms can be done by reducing the pattern transformation problem to an appropriate language recognition problem where a new type of d-dimensional words and languages with an appropriate recognition process is introduced. Unfortunately, the resulting languages often are not very well suited to the application of well known and (meanwhile) standardized cellular techniques. Here we present a systematic method, how additional information can be added to the words to be recognized in order to facilitate the application of these techniques. The with-additional-information recognizing process can be converted algorithmically into a without-additional-information recognizing one.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Pecht, J.G.: Ein weiterer Ansatz zur Mustertransformation und-erkennung in zellularen Räumen, Dissertation, TU Braunschweig, 1980.Google Scholar
  2. [2]
    Pecht, J.G.: A new heuristic concept to develop fast cellular pattern transformation algorithms, in: Kunt, M., and de Coulon, F. (editors): Signal Processing Theories and Applications, North-Holland, 1980, 207–212; Errata: p. 793.Google Scholar
  3. [3]
    Pecht, J.G.: T-recognition of T-languages, a new approach to describe and exploit the parallel capabilities of d-dimensional tesselation structures, submitted for publication.Google Scholar
  4. [4]
    Pecht, J.G.: The reduction of d-dimensional pattern transformations by d-dimensional tesselation structures to the T-recognition of T-languages, in preparation.Google Scholar
  5. [5]
    Smith III, A.R.: Two-dimensional formal languages and pattern recognition by cellular automata, Conference Record of the 12th Annual IEEE Symposium on Switching and Automata Theory 12 (1971), 144–152.Google Scholar
  6. [6]
    Vollmar, R.: Cellular spaces and parallel algorithms — an introductory survey —, in: Feilmeier, M. (editor): Parallel Computers — Parallel Mathematics. IMACS, Amsterdam, 1977, 49–58.Google Scholar
  7. [7]
    Vollmar, R.: Algorithmen in Zellularautomaten, Teubner, Stuttgart, 1979.zbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1981

Authors and Affiliations

  • Josef Pecht
    • 1
  1. 1.Lehrstuhl C für Informatik der TU BraunschweigBraunschweigWest-Germany

Personalised recommendations