peer reviewed / Building on a thick strand of the literature on the determinants of higher-order births, this study uses a gender and class perspective to analyse second birth progression rates in Germany. Using data from the German Socio-Economic Panel from 1990 to 2020, individuals are classified based on their occupation into: upper service, low...
Firstly studied by Kempa and Prezza in 2018 as the cement of text compression algorithms, string attractors have become a compelling object of theoretical research within the community of combinatorics on words. In this context, they have been studied for several families of finite and infinite words. In this paper, we obtain string attractors of p...
In formal languages and automata theory, the magic number problem can be formulated as follows: for a given integer n, is it possible to find a number d in the range [n,2n] such that there is no minimal deterministic finite automaton with d states that can be simulated by an optimal nondeterministic finite automaton with exactly n states? If such a...
status: published
The method of generalized pairwise comparisons (GPC) is an extension of the well-known nonparametric Wilcoxon-Mann-Whitney test for comparing two groups of observations. Multiple generalizations of Wilcoxon-Mann-Whitney test and other GPC methods have been proposed over the years to handle censored data. These methods apply different approaches to ...
status: accepted
status: accepted
status: published
In combinatorics on words, for two words u and v, the binomial coefficient (u,v) of u and v is the number of times v appears as a (scattered) subword of u. For example, with u=ababba and v=aba, there are (6,3)=15 ways to select 3 letters among 6, but only (u,v)=6 of them give back v. Generalizing famous binomial coefficients of integers, the word v...
status: accepted
