The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Smooth infinite words over Σ={1,2} are connected to the Kolakoski word K=221121⋯, defined as the fixpoint of the function Δ that counts the length of the runs of 1's and 2's. In this paper we extend the notion of smooth words to arbitrary alphabets and study some of their combinatorial properties. Using the run-length encoding Δ, every word is represented by a word obtained from the iterations of...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.