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}
}
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. 

Topics from this paper.

Citations

Publications citing this paper.