• Computer Science
• Published in MFCS 1981
• DOI:10.1007/3-540-10856-4_107

On the Constructive Description of Graph Languages Accepted by Finite Automata

@inproceedings{Kreowski1981OnTC,
  title={On the Constructive Description of Graph Languages Accepted by Finite Automata},
  author={Hans-J{\"o}rg Kreowski and Grzegorz Rozenberg},
  booktitle={MFCS},
  year={1981}
}

• Hans-Jörg Kreowski, Grzegorz Rozenberg

View via Publisher

Save to Library

Create Alert

Cite

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.