arXiv (All)
open access
Pumping Constants for Infinite Alphabets
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 infinite alphabets states that the pumped patterns need not be identical, but only equivalent up to a finite-order perm
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Unique ergodicity, and not, for primitive substitutions on compact alphabets containing isolated points#984464
- Phase transitions for percolation of words in one dimension#972061
- Le rôle de la fréquence et des familles de mots dans la formation des doubles suffixes en français#796383
- Industrial applications of large language models#359605
- On the topological dynamical system of tilings#1306347
Record · ID 1215804
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive