activity
20112024
most citedSeparating Regular Languages with First-Order Logic

50 citations · 111 across the 24 of their papers we have counts for

collaborators

30 papers

cs.FL2024★ 1 cited

Navigational hierarchies of regular languages

Thomas Place, Marc Zeitoun

We study the class of star-free languages. A long-standing goal is to classify them by the complexity of their descriptions. The most influential research effort involves concatena…

cs.FL2024★ 1 cited

Dot-depth three, return of the J-class

Thomas Place, Marc Zeitoun

We look at concatenation hierarchies of classes of regular languages. Each such hierarchy is determined by a single class, its basis: level is built by applying the Boolean pol…

cs.FL2023

Closing star-free closure

Thomas Place, Marc Zeitoun

We introduce an operator on classes of regular languages, the star-free closure. Our motivation is to generalize standard results of automata theory within a unified framework. Giv…

cs.FL2023

A generic characterization of generalized unary temporal logic and two-variable first-order logic

Thomas Place, Marc Zeitoun

We investigate an operator on classes of languages. For each class , it outputs a new class associated with a variant of two-variable first-order logic equipped with…

cs.FL2022

A generic polynomial time approach to separation by first-order logic without quantifier alternation

Thomas Place, Marc Zeitoun

We look at classes of languages associated to the fragment of first-order logic BΣ1 which disallows quantifier alternations. Each class is defined by choosing the set of predicates…

cs.FL2022★ 4 cited

All about unambiguous polynomial closure

Thomas Place, Marc Zeitoun

We study a standard operator on classes of languages: unambiguous polynomial closure. We prove that for every class C of regular languages satisfying mild properties, the membershi…