On Infinite Words Determined by Indexed Languages
Tim Smith

TL;DR
This paper characterizes infinite words determined by indexed languages, showing they are exactly the morphic words, and introduces a new pumping lemma for indexed languages that may have broader applications.
Contribution
It proves that infinite words determined by indexed languages are precisely the morphic words and introduces a novel pumping lemma for indexed languages.
Findings
Infinite words determined by indexed languages are exactly the morphic words.
A new pumping lemma for indexed languages is established.
The result bridges indexed languages and morphic words in formal language theory.
Abstract
We characterize the infinite words determined by indexed languages. An infinite language determines an infinite word if every string in is a prefix of . If is regular or context-free, it is known that must be ultimately periodic. We show that if is an indexed language, then is a morphic word, i.e., can be generated by iterating a morphism under a coding. Since the other direction, that every morphic word is determined by some indexed language, also holds, this implies that the infinite words determined by indexed languages are exactly the morphic words. To obtain this result, we prove a new pumping lemma for the indexed languages, which may be of independent interest.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicssemigroups and automata theory · Algorithms and Data Compression · Natural Language Processing Techniques
