6 citations · 7 across the 5 of their papers we have counts for
Showing 2014Show all
2 papers · 1 filter
cs.FL2014
The Emptiness Problem for Tree Automata with at Least One Disequality Constraint is NP-hard
P. -C Héam, V. Hugot, O. Kouchnarenko
The model of tree automata with equality and disequality constraints was introduced in 2007 by Filiot, Talbot and Tison. In this paper we show that if there is at least one disequa…
cs.SE2014★ 6 cited
Component Substitution through Dynamic Reconfigurations
Arnaud Lanoix, Olga Kouchnarenko
Component substitution has numerous practical applications and constitutes an active research topic. This paper proposes to enrich an existing component-based framework--a model wi…