The Kleene Equality for Graphs
In order to generalize the Kleene theorem from the free monoid to richer algebraic structures, we consider the non deterministic acceptance by a finite automaton of subsets of vertices of a graph. The subsets accepted in such a way are the equational subsets of vertices of the graph in the sense of Mezei and Wright. We introduce the notion of deterministic acceptance by finite automaton. A graph satisfies the Kleene equality if the two acceptance modes are equivalent, and in this case, the equational subsets form a Boolean algebra. We establish that the infinite grid and the transition graphs of deterministic pushdown automata satisfy the Kleene equality and we present families of graphs in which the free product of graphs preserves the Kleene equality.
KeywordsBoolean Algebra Cayley Graph Free Product Colored Vertex Free Monoid
Unable to display preview. Download preview PDF.
- [Cau96]Caucal, D.: On infinite transition graphs having a decidable monadic theory. In: Meyer auf der Heide, F., Monien, B. (eds.) ICALP 1996. LNCS, vol. 1099, pp. 194–205. Springer, Heidelberg (1996)Google Scholar
- [Cou89]Courcelle, B.: On recognizable sets and tree automata. In: Resolution of Equations in Algebraic Structures. Academic Press, London (1989)Google Scholar
- [ES69]Eilenberg, S., Schützenberger, M.: Rational sets in commutative monoids. J. Algebra 13, 344–353 (1969)Google Scholar