Related papers: Existential length universality
Two languages are "finitely different" if their symmetric difference is finite. We consider the DFAs of finitely different regular languages and find major structural similarities. We proceed to consider the smallest DFAs that recognize a…
Let A be a finite or countable alphabet and let $\theta$ be a literal (anti-)automorphism onto A * (by definition, such a correspondence is determinated by a permutation of the alphabet). This paper deals with sets which are invariant under…
A regular language $L$ is said to be prime, if it is not the product of two non-trivial languages. Martens et al. settled the exact complexity of deciding primality for deterministic finite automata in 2010. For finite languages, Mateescu…
For a finite abelian group $G$ and a positive integer $d$, let $\mathsf s_{d \mathbb N} (G)$ denote the smallest integer $\ell \in \mathbb N_0$ such that every sequence $S$ over $G$ of length $|S| \ge \ell$ has a nonempty zero-sum…
Unlike in statistical compression, where Shannon's entropy is a definitive lower bound, no such clear measure exists for the compressibility of repetitive sequences. Since statistical entropy does not capture repetitiveness, ad-hoc measures…
We show that simple syntactic expressions such as existential second order (ESO) universal Horn formulae can express NP-hard optimisation problems. There is a significant difference between the expressibilities of decision problems and…
Let $(G,+)$ be a finite abelian group. Then, $\so(G)$ and $\eta(G)$ denote the smallest integer $\ell$ such that each sequence over $G$ of length at least $\ell$ has a subsequence whose terms sum to $0$ and whose length is equal to and at…
This article discusses completeness of Boolean Algebra as First Order Theory in Goedel's meaning. If Theory is complete then any possible transformation is equivalent to some transformation using axioms, predicates etc. defined for this…
Large language models (LLMs) have demonstrated strong performance on formal language tasks, yet whether this reflects genuine symbolic reasoning or pattern matching on familiar constructions remains unclear. We introduce a benchmark for…
Point singularities of solutions to the classical Lane-Emden-Serrin equation have a polyhomogeneous asymptotic expansion whose logarithmic corrections are determined by a first order ODE. Surprisingly, we are able to discover such an ODE…
In this paper we examine decision problems associated with various classes of convex languages, studied by Ang and Brzozowski (under the name "continuous languages"). We show that we can decide whether a given language L is prefix-,…
We study the asymptotic behavior as $p\to\infty$ of the Gelfand problem \[ -\Delta_{p} u=\lambda\,e^{u}\ \textrm{in}\ \Omega\subset\mathbb{R}^n,\quad u=0 \ \textrm{on}\ \partial\Omega. \] Under an appropriate rescaling on $u$ and $\lambda$,…
We consider the general problem of the Longest Common Subsequence (LCS) on weighted sequences. Weighted sequences are an extension of classical strings, where in each position every letter of the alphabet may occur with some probability.…
We answer two open questions by (Gruber, Holzer, Kutrib, 2009) on the state-complexity of representing sub- or superword closures of context-free grammars (CFGs): (1) We prove a (tight) upper bound of $2^{\mathcal{O}(n)}$ on the size of…
We consider integer sequences that satisfy a recursion of the form $x_{n+1} = P(x_n)$ for some polynomial $P$ of degree $d > 1$. If such a sequence tends to infinity, then it satisfies an asymptotic formula of the form $x_n \sim A…
Let $s(n)$ be the number of nonzero bits in the binary digital expansion of the integer $n$. We study, for fixed $k,\ell,m$, the Diophantine system $$ s(ab)=k, \quad s(a)=\ell,\quad \mbox{and }\quad s(b)=m, $$ in odd integer variables…
Many canonical machine learning problems boil down to a convex optimization problem with a finite sum structure. However, whereas much progress has been made in developing faster algorithms for this setting, the inherent limitations of…
Although Dynamic Epistemic Logic (DEL) is an influential logical framework for representing and reasoning about information change, little is known about the computational complexity of its associated decision problems. In fact, we only…
Abstract differential-algebraic equations (ADAEs) of a semilinear type are studied. Theorems on the existence and uniqueness of solutions and the maximal interval of existence, on the global solvability of the ADAEs, the boundedness of…
A frequency permutation array (FPA) of length $n=m\lambda$ and distance $d$ is a set of permutations on a multiset over $m$ symbols, where each symbol appears exactly $\lambda$ times and the distance between any two elements in the array is…