Directed Graphs and Syntactic Algebras of Tree Languages
Andrei V. Kelarev, Olga Sokratova · eCite Digital Repository (University of Tasmania) · 2001
We describe all graphs with algebras isomorphic to syntactic algebras of tree languages. In the case of undirected graphs we show that a graph algebra is syntactic if and only if it is a 0-direct union of subdirectly irreducible groupoids.