On the constructive description of graph languages accepted by finite automata

  • Hans-Jörg Kreowski
  • Grzegorz Rozenberg
Part of the Lecture Notes in Computer Science book series (LNCS, volume 118)


A new approach to accepting graph languages is introduced. It employs ordinary finite (string) automata traversing (directed edgelabeled) graphs. Several characterizations of the class of graph languages obtained in this way are provided.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. /CER 78/.
    V. Claus, H. Ehrig, G. Rozenberg: Graph Grammars and Their Application to Computer Science and Biology, Lect. Not. in Comp. Sci., vol. 73, Springer-Verlag, Berlin-Heidelberg-New York 1979.Google Scholar
  2. /Ha 65/.
    M.A. Harrison: Introduction to Switching and Automata Theory, McGraw-Hill, New York 1965.Google Scholar
  3. /Na 79/.
    M. Nagl: Graph-Grammatiken, Vieweg & Sohn, Braunschweig-Wiesbaden 1979.Google Scholar
  4. /RM 72/.
    A. Rosenfeld, D. Milgram: Web Automata and Web Grammars, Maschine Intelligence 7, 307–324 (1972).Google Scholar
  5. /WR 79/.
    A. Wu, A. Rosenfeld: Cellular Graph Automata, in /CER 78/, 464–475.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1981

Authors and Affiliations

  • Hans-Jörg Kreowski
    • 1
  • Grzegorz Rozenberg
    • 2
  1. 1.Fachbereich InformatikTechnische Universität BerlinBerlin 10F.R.G.
  2. 2.Subfaculteit der WiskundeRijksuniversiteit te LeidenLeidenThe Netherlands

Personalised recommendations