50 citations · 111 across the 24 of their papers we have counts for
Showing 2015Show all
3 papers · 1 filter
cs.FL2015★ 2 cited
Quantifier Alternation for Infinite Words
Théo Pierron, Thomas Place, Marc Zeitoun
We investigate the expressive power of quantifier alternation hierarchy of first-order logic over words. This hierarchy includes the classes (sentences having at most blo…
cs.LO2015
Deciding definability in FO2(<h,<v) on trees
Thomas Place, Luc Segoufin
We provide a decidable characterization of regular forest languages definable in FO2(<h,<v). By FO2(<h,<v) we refer to the two variable fragment of first order logic built from the…
cs.FL2015★ 1 cited
A Transfer Theorem for the Separation Problem
Thomas Place, Marc Zeitoun
We investigate two problems for a class C of regular word languages. The C-membership problem asks for an algorithm to decide whether an input language belongs to C. The C-separati…