Algebras, automata and logic for languages of labeled birooted trees

David Janin (1)

1 LaBRI - Laboratoire Bordelais de Recherche en Informatique

In this paper, we study the languages of labeled finite birooted trees: Munn's birooted trees extended with vertex labeling. We define a notion of finite state birooted tree automata that is shown to capture the class of languages that are upward closed w.r.t. the natural order and definable in Monadic Second Order Logic. Then, relying on the inverse monoid structure of labeled birooted trees, we derive a notion of recognizable languages by means of (adequate) premorphisms into finite (adequately) ordered monoids. This notion is shown to capture finite boolean combinations of languages as above. We also provide a simple encoding of finite (mono-rooted) labeled trees in an antichain of labeled birooted trees that shows that classical regular languages of finite (mono-rooted) trees are also recognized by such premorphisms and finite ordered monoids.

Mots clés: languages of birooted trees; partially ordered monoids; premorphisms; monadic second order logic; algebraic recognizability

Domaines: Théorie et langage formel [cs.FL]

David Janin. Algebras, automata and logic for languages of labeled birooted trees. ICALP, 2013, Riga, Latvia. pp.318-329, ⟨10.1007/978-3-642-39212-2_29⟩. ⟨hal-00784898v2⟩