A Pumping-Like Lemma for Languages over Infinite Alphabets
Yoav Danieli · arXiv (Cornell University) · 2026
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 languages is semi-linear.