On Infinite Words Determined by L Systems
نویسنده
چکیده
A deterministic L system generates an infinite word α if each word in its derivation sequence is a prefix of the next, yielding α as a limit. We generalize this notion to arbitrary L systems via the concept of prefix languages. A prefix language is a language L such that for all x, y ∈ L, x is a prefix of y or y is a prefix of x. Every infinite prefix language determines a single infinite word. Where C is a class of L systems (e.g. 0L, DT0L), we denote by ω(C) the class of infinite words determined by the prefix languages in C. This allows us to speak of infinite 0L words, infinite DT0L words, etc. We categorize the infinite words determined by a variety of L systems, showing that the whole hierarchy collapses to just three distinct classes of infinite words: ω(PD0L), ω(D0L), and ω(CD0L). Our results are obtained with the help of a pumping lemma which we prove for T0L systems.
منابع مشابه
On Infinite Words Determined by Indexed Languages
We characterize the infinite words determined by indexed languages. An infinite language L determines an infinite word α if every string in L is a prefix of α. If L is regular or context-free, it is known that α must be ultimately periodic. We show that if L is an indexed language, then α is a morphic word, i.e., α can be generated by iterating a morphism under a coding. Since the other directi...
متن کاملA new pumping lemma for indexed languages, with an application to infinite words
We prove a pumping lemma in order to characterize the infinite words determined by indexed languages. An infinite language L determines an infinite word α if every string in L is a prefix of α. If L is regular or context-free, it is known that α must be ultimately periodic. We show that if L is an indexed language, then α is a morphic word, i.e., α can be generated by iterating a morphism under...
متن کاملOn Infinite Words Determined by Stack Automata
We characterize the infinite words determined by one-way stack automata. An infinite language L determines an infinite word α if every string in L is a prefix of α. If L is regular or context-free, it is known that α must be ultimately periodic. We extend this result to the class of languages recognized by one-way nondeterministic checking stack automata (1-NCSA). We then consider stronger clas...
متن کاملOn the $c_{0}$-solvability of a class of infinite systems of functional-integral equations
In this paper, an existence result for a class of infinite systems of functional-integral equations in the Banach sequence space $c_{0}$ is established via the well-known Schauder fixed-point theorem together with a criterion of compactness in the space $c_{0}$. Furthermore, we include some remarks to show the vastity of the class of infinite systems which can be covered by our result. The a...
متن کاملOn the Computational Complexity of Infinite Words
This paper contains answers to several problems in the theory of the computational complexity of infinite words. We show that the problem whether all infinite words generated by iterating dgsm’s have logarithmic space complexity is equivalent to the open problem asking whether the unary classes of languages in P and in DLOG are equivalent. Similarly, the problem to find a concrete infinite word...
متن کامل