2 citations · 3 across the 6 of their papers we have counts for
6 papers
Algebraic extensions in free groups
Alexei Miasnikov, Enric Ventura, Pascal Weil
The aim of this paper is to unify the points of view of three recent and independent papers (Ventura 1997, Margolis, Sapir and Weil 2001 and Kapovich and Miasnikov 2002), where sim…
Algebraic recognizability of regular tree languages
Zoltan Esik, Pascal Weil
We propose a new algebraic framework to discuss and classify recognizable tree languages, and to characterize interesting classes of such languages. Our algebraic tool, called prec…
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…
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…
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…
On an algorithm to decide whether a free group is a free factor of another
Pedro Silva, Pascal Weil
We revisit the problem of deciding whether a finitely generated subgroup H is a free factor of a given free group F. Known algorithms solve this problem in time polynomial in the s…