Showing cs.FLShow all
3 papers · 1 filter
cs.FL2026
Pumping Constants for Infinite Alphabets
Yoav Danieli
It is well known that the pumping lemma for regular languages over finite alphabets does not extend to infinite alphabets. Instead, the generalized version of the pumping lemma for…
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.FL2025
A pumping-like lemma for languages over infinite alphabets
Yoav Danieli
We prove a pumping-like lemma for languages accepted by one-register alternating finite-memory automata over an infinite alphabet. Every sufficiently long accepted word has a nonem…