Embedding finite and infinite words into overlapping tiles
Résumé
In this paper, we study languages of finite and infinite birooted words. We show how the embedding of free ω-semigroups of finite and infinite words into the monoid of birooted words can be generalized to the embedding of two-sorted ω-semigroups into (some notion of) one- sorted ordered ω-monoids. This leads to an algebraic characterization of regular languages of finite and infinite birooted words that generalizes and unifies the known algebraic characterizations of regular languages of finite and infinite words.
Origine : Fichiers produits par l'(les) auteur(s)
Loading...