Related papers: Regular Separability in B\"{u}chi VASS
We study the fluted fragment of first-order logic which is often viewed as a multi-variable non-guarded extension to various systems of description logics lacking role-inverses. In this paper we show that satisfiable fluted sentences (even…
The paper considers algorithmic properties of classical and non-classical first-order logics and theories in bounded languages. The main idea is to prove the undecidability of various fragments of classical and non-classical first-order…
We prove several decidability and undecidability results for the satisfiability and validity problems for languages that can express solutions to word equations with length constraints. The atomic formulas over this language are equality…
For every fixed class of regular languages, there is a natural hierarchy of increasingly more general problems: Firstly, the membership problem asks whether a given language belongs to the fixed class of languages. Secondly, the separation…
We consider vector-valued solutions to a linear transmission problem, and we prove that Lipschitz-regularity on one phase is transmitted to the next phase. More exactly, given a solution $u:B_1\subset \mathbb{R}^n \to \mathbb{R}^m$ to the…
Patterns are words with terminals and variables. The language of a pattern is the set of words obtained by uniformly substituting all variables with words that contain only terminals. Length constraints restrict valid substitutions of…
We study the finite satisfiability problem for the two-variable fragment of first-order logic extended with counting quantifiers (C2) and interpreted over linearly ordered structures. We show that the problem is undecidable in the case of…
We study effectively inseparable (e.i.) pre-lattices (i.e. structures of the form $L=\langle \omega, \wedge, \lor, 0, 1, \leq_L\rangle$ where $\omega$ denotes the set of natural numbers and the following hold: $\wedge, \lor$ are binary…
Regular model checking is a well-established technique for the verification of regular transition systems (RTS): transition systems whose initial configurations and transition relation can be effectively encoded as regular languages. In…
We investigate the regularity of the free boundary for a general class of two-phase free boundary problems with non-zero right hand side. We prove that Lipschitz or flat free boundaries are $C^{1,\gamma}$. In particular, viscosity solutions…
We set up a descriptive set-theoretic framework to study Lipschitz-free spaces and use the reduction argument of Bossard to prove several results. We prove two universality results: if a separable Banach space is isomorphically universal…
For an ordinal $\lambda>0$, we use the Erd\H{o}s--Rado partition theorem to prove the failure of strong completeness of $\mathsf{GL}$ for modal languages of cardinality $(2^{|\lambda|+\aleph_0})^{+}$ with respect to models on ordinals…
Using Shelah's revised GCH theorem we prove that if mu<beth_omega <= lambda are cardinals, then every mu-almost disjoint subfamily B of [lambda]^{beth_omega} is essentially disjoint, i.e. for each b from B there is a subset f(b) of b of…
Probabilistic linear discriminant analysis (PLDA) has broad application in open-set verification tasks, such as speaker verification. A key concern for PLDA is that the model is too simple (linear Gaussian) to deal with complicated data;…
We study the link between stably finiteness and stably projectionless-ness for $C^*$-algebras of solvable Lie groups. We show that these two properties are equivalent if the dimension of the group is not divisible by $4$; otherwise, they…
The complexity and decidability of various decision problems involving the shuffle operation are studied. The following three problems are all shown to be $NP$-complete: given a nondeterministic finite automaton (NFA) $M$, and two words $u$…
Spatial consistency is a fundamental property of the visual world and a key requirement for models that aim to understand physical reality. Despite recent advances, multimodal large language models (MLLMs) often struggle to reason about 3D…
The separating words problem asks for the size of the smallest DFA needed to distinguish between two words of length <= n (by accepting one and rejecting the other). In this paper we survey what is known and unknown about the problem,…
Finding a logical formula that separates positive and negative examples given in the form of labeled data items is fundamental in applications such as concept learning, reverse engineering of database queries, generating referring…
Given a regular language $L$, we study the language of words $\mathsf{D}(L)$, that distinguish between pairs of different left-quotients of $L$. We characterize this distinguishability operation, show that its iteration has always a fixed…