Bridging Two Hierarchies of Infinite Words
نویسنده
چکیده
Infinite words on a finite non-empty alphabet have been investigated in various respects. We will consider here two important strategies in approaching such words; one of them proceeds from particular to general, while the other proceeds from general to particular. As we shall see, the respective hierarchies don’t interfer. There is between them an empty space waiting for investigation.
منابع مشابه
Variations of the Morse-Hedlund Theorem for k-Abelian Equivalence
In this paper we investigate local-to-global phenomena for a new family of complexity functions of infinite words indexed by k ∈ N1∪{+∞} where N1 denotes the set of positive integers. Two finite words u and v in A∗ are said to be k-abelian equivalent if for all x ∈ A∗ of length less than or equal to k, the number of occurrences of x in u is equal to the number of occurrences of x in v. This def...
متن کاملTwo infinite hierarchies of languages defined by branching grammars
Two types of branching grammars are introduced inspired from Havel's works about branching automata. They naturally define two infinite hierarchies into the family of regular, respectively, linear languages. Homomorphic characterisations of regular and linear languages >n terms of branching languages are obtained. Finally, the relations between branching grammars and contextual grammars of [5] ...
متن کاملJaakko Hintikka
The continuum hypothesis (CH) is crucial in the core area of set theory, viz. in the theory of the hierarchies of infinite cardinal and infinite ordinal numbers. It is crucial in that it would, if true, help to relate the two hierarchies to each other. It says that the second infinite cardinal number, which is known to be the cardinality of the first uncountable ordinal, equals the cardinality ...
متن کاملInfinite Hierarchies of Conformon-P Systems
Two models of conformon-P systems, one restricted in the number of input conformons and the other restricted in the number of input membranes, are proved to induce infinite hierarchies. The described systems do not work under the requirement of maximal parallelism and perform deterministic simulations of restricted counter machines.
متن کاملSubshifts, MSO Logic, and Collapsing Hierarchies
We use monadic second-order logic to define two-dimensional subshifts, or sets of colorings of the infinite plane. We present a natural family of quantifier alternation hierarchies, and show that they all collapse to the third level. In particular, this solves an open problem of [Jeandel & Theyssier 2013]. The results are in stark contrast with picture languages, where such hierarchies are usua...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. UCS
دوره 8 شماره
صفحات -
تاریخ انتشار 2002