output
20062026
most citedEstimating conditional quantiles with the help of the pinball loss

227 citations

researchers with a paper here
collaborating institutions
Showing cs.FLShow all

6 papers · 1 filter

cs.FL2018★ 1 cited

Efficient Membership Testing for Pseudovarieties of Finite Semigroups

Lukas Fleischer

We consider the complexity of deciding membership of a given finite semigroup to a fixed pseudovariety. While it is known that there exist pseudovarieties with NP-complete or even…

cs.FL2014

A Survey on the Local Divisor Technique

Volker Diekert, Manfred Kufleitner

Local divisors allow a powerful induction scheme on the size of a monoid. We survey this technique by giving several examples of this proof method. These applications include linea…

cs.FL2012★ 2 cited

The Join Levels of the Trotter-Weil Hierarchy are Decidable

Manfred Kufleitner, Alexander Lauser

The variety DA of finite monoids has a huge number of different characterizations, ranging from two-variable first-order logic FO^2 to unambiguous polynomials. In order to study th…

cs.FL2012

Lattices of Logical Fragments over Words

Manfred Kufleitner, Alexander Lauser

This paper introduces an abstract notion of fragments of monadic second-order logic. This concept is based on purely syntactic closure properties. We show that over finite words, e…

cs.FL2011

Regular Ideal Languages and Their Boolean Combinations

Franz Jahn, Manfred Kufleitner, Alexander Lauser

We consider ideals and Boolean combinations of ideals. For the regular languages within these classes we give expressively complete automaton models. In addition, we consider gener…

cs.FL2011

Languages of Dot-depth One over Infinite Words

Manfred Kufleitner, Alexander Lauser

Over finite words, languages of dot-depth one are expressively complete for alternation-free first-order logic. This fragment is also known as the Boolean closure of existential fi…