A Kleene Theorem for Forest Languages

This paper proposes an alternative approach to the standard notion of rational (or regular) expression for tree languages. The main difference is that in the new notion we have only one concatenation operation and only one star-operation, instead of many different ones. This is achieved by considering forests instead of trees over a ranked alphabet, or, algebraicly speaking, by considering cartesian categories instead of term-algebras. The main result is that in the free cartesian category the rational languages and the recognizable languages coincide. For the construction of the rational expression for a recognizable language it is not necessary to extend the alphabet. We only use operations that can be defined with the algebraic structure provided by cartesian categories.

• Type: Conference
• Year: 2009
• Where: LATA
• Authors: Lutz Straßburger
• Keywords: Automata Theory, Cartesian Categories, LATA 2009, Recognizable Language, Recognizable Languages Coincide