A pumping-like lemma for languages over infinite alphabets
Fuente:
arXiv
Enregistré dans:
| Auteur principal: | |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866915698218893312 |
|---|---|
| author | Danieli, Yoav |
| author_facet | Danieli, Yoav |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2512_23403 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | A pumping-like lemma for languages over infinite alphabets Danieli, Yoav Formal Languages and Automata Theory 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. |
| title | A pumping-like lemma for languages over infinite alphabets |
| topic | Formal Languages and Automata Theory |
| url | https://arxiv.org/abs/2512.23403 |