Skip to main content
SpringerLink
Log in

On the constructive description of graph languages accepted by finite automata

  • Communications
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1981 (MFCS 1981)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 118))

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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. M.A. Harrison: Introduction to Switching and Automata Theory, McGraw-Hill, New York 1965.

    Google Scholar 

  3. M. Nagl: Graph-Grammatiken, Vieweg & Sohn, Braunschweig-Wiesbaden 1979.

    Google Scholar 

  4. A. Rosenfeld, D. Milgram: Web Automata and Web Grammars, Maschine Intelligence 7, 307–324 (1972).

    Google Scholar 

  5. A. Wu, A. Rosenfeld: Cellular Graph Automata, in /CER 78/, 464–475.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich Informatik, Technische Universität Berlin, Otto-Suhr-Allee 18/20, D-1000, Berlin 10, F.R.G.

    Hans-Jörg Kreowski

  2. Subfaculteit der Wiskunde, Rijksuniversiteit te Leiden, Wassenaarseweg 80, Postbus 9512, 2300 RA, Leiden, The Netherlands

    Grzegorz Rozenberg

Authors
  1. Hans-Jörg Kreowski
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Grzegorz Rozenberg
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jozef Gruska Michal Chytil

Rights and permissions

Reprints and permissions

Copyright information

© 1981 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kreowski, HJ., Rozenberg, G. (1981). On the constructive description of graph languages accepted by finite automata. In: Gruska, J., Chytil, M. (eds) Mathematical Foundations of Computer Science 1981. MFCS 1981. Lecture Notes in Computer Science, vol 118. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10856-4_107

Download citation

  • DOI: https://doi.org/10.1007/3-540-10856-4_107

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-10856-6

  • Online ISBN: 978-3-540-38769-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation