50 citations · 146 across the 25 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
cs.FL2018
The complexity of separation for levels in concatenation hierarchies
Thomas Place, Marc Zeitoun
We investigate the complexity of the separation problem associated to classes of regular languages. For a class C, C-separation takes two regular languages as input and asks whethe…
cs.FL2018
A generic characterization of Pol(C)
Thomas Place, Marc Zeitoun
We investigate the polynomial closure operation (C -> Pol(C)) defined on classes of regular languages. We present an interesting and useful connection relating the separation probl…