Handbook of formal languages, vol. 1
Languages, automata, and logic
Handbook of formal languages, vol. 3
Relational morphisms, transductions and operations on languages
Proceedings of the LITP Spring School on Theoretical Computer Science: Formal Properties of Finite Automata and Applications
Recognisability for algebras of infinite trees
Theoretical Computer Science
Quasi-recognizable vs MSO definable languages of one-dimensional overlapping tiles
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
The T-calculus: towards a structured programing of (musical) time and space
Proceedings of the first ACM SIGPLAN workshop on Functional art, music, modeling & design
| Hi-index | 0.00 |
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.