3 papers
cs.FL2026
Star Complexity of Parikh Images of Languages over Infinite Alphabets
Yoav Danieli
It has been conjectured that the Parikh (commutative) image of every language over an infinite alphabet recognized by an automaton with registers is defined by a rational expressio…
cs.DS2026
Mind the Gap. Doubling Constant Parametrization of Weighted Problems: TSP, Max-Cut, and More
Mihail Stoian
Despite much research, hard weighted problems still resist super-polynomial improvements over their textbook solution. On the other hand, the unweighted versions of these problems…
cs.FL2025
A pumping-like lemma for languages over infinite alphabets
Yoav Danieli
We prove a kind of a pumping lemma for languages accepted by one-register alternating finite-memory automata. As a corollary, we obtain that the set of lengths of words in such lan…