-
Efficient Reasoning about Data Trees via Integer Linear Programming
International audience -
E-unification by means of tree tuple synchronized grammars
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
