23 citations · 79 across the 26 of their papers we have counts for
Showing 2006 · cs.LOShow all
3 papers · 2 filters
cs.LO2006★ 2 cited
Algebraic recognizability of languages
Pascal Weil
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 would like t…
cs.LO2006
The recognizability of sets of graphs is a robust property
Bruno Courcelle, Pascal Weil
Once the set of finite graphs is equipped with an algebra structure (arising from the definition of operations that generalize the concatenation of words), one can define the notio…
cs.LO2006★ 1 cited
On the logical definability of certain graph and poset languages
Pascal Weil
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 second-order logic), a…