TWO ALGORITHMS FOR LANGUAGES RECOGNIZED BY GRAPH ALGEBRAS

摘要

In this paper we give an algorithmic description of all regular languages recognized by graph algebras of directed graphs. A description of the analogous class of regular languages for the case of undirected graphs is obtained as a corollary.