Periodicity, repetitions, and orbits of an automatic sequence
نویسندگان
چکیده
We revisit a technique of S. Lehr on automata and use it to prove old and new results in a simple way. We give a very simple proof of the 1986 theorem of Honkala that it is decidable whether a given k-automatic sequence is ultimately periodic. We prove
منابع مشابه
On the Frequency and Periodicity of Infinite Words On the Frequency and Periodicity of Infinite Words
This work contributes to two aspects of the understanding of infinite words: the frequency of letters in a morphic sequence and periodicity considerations on infinite words. First, we develop a necessary and sufficient criteria for the existence of the frequency of a letter in a morphic sequence, and give some applications of this result. We show that the frequencies of all letters exist in pur...
متن کاملGlobal stabilization of periodic orbits in chaotic systems by using symbolic dynamics
In this report, a control method for the stabilization of periodic orbits for a class of discrete-time systems that are topologically conjugate to symbolic dynamics is proposed and applied to a population model in an ecosystem and the Smale horseshoe map. A periodic orbit is assigned as a target by giving a sequence in which symbols have periodicity. As a consequence, it is shown that any perio...
متن کاملStudy of Bifurcations in Current-Programmed Dc/dc Boost Converters: From Quasi-Periodicity to Period - Circuits and Systems I: Fundamental Theory and Applications, IEEE Transactions on
This paper studies the bifurcation paths exhibited by a simple second-order dc/dc boost converter under currentprogrammed control with and without voltage feedback. Previous work in this area has reported two distinct types of bifurcation paths, namely via regions of quasi-periodic orbits and perioddoubling. This paper demonstrates that the two different types of bifurcation paths can, in fact,...
متن کاملKnowing What to Respond in the Future Does Not Cancel the Influence of Past Events
Everyday tasks seldom involve isolate actions but sequences of them. We can see whether previous actions influence the current one by exploring the response time to controlled sequences of stimuli. Specifically, depending on the response-stimulus temporal interval (RSI), different mechanisms have been proposed to explain sequential effects in two-choice serial response tasks. Whereas an automat...
متن کاملPeriodicity in Streams
In this work we study sublinear space algorithms for detecting periodicity over data streams. A sequence of length n is said to be periodic if it consists of repetitions of a block of length p for some p ≤ n 2 . In the first part of this paper, we give a 1-pass randomized streaming algorithm that uses O(log n) space and reports the shortest period if the given stream is periodic. At the heart o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 410 شماره
صفحات -
تاریخ انتشار 2009