A pumping-like lemma for languages over infinite alphabets
Formal Languages and Automata Theory
2025-12-30 v1
Abstract
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.
Cite
@article{arxiv.2512.23403,
title = {A pumping-like lemma for languages over infinite alphabets},
author = {Yoav Danieli},
journal= {arXiv preprint arXiv:2512.23403},
year = {2025}
}