-
Overlapping tile automata
International audience -
Algebras, automata and logic for languages of labeled birooted trees
International audience -
On the logical definability of certain graph and poset languages
We show that it is equivalent, for certain sets of finite graphs, to be definable in CMS (counting monadic second-order logic, a natural extension of monadic... -
The recognizability of sets of graphs is a robust property
International audience -
Algebraic recognizability of languages
Recognizable languages of finite words are part of every computer science cursus, and they are routinely described as a cornerstone for applications and for theory. We... -
Algebraic recognizability of regular tree languages
International audience -
On labeled birooted tree languages: algebras, automata and logic
International audience
