On Periodicity of Generalized Pseudostandard Words

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21340%2F16%3A00221665" target="_blank" >RIV/68407700:21340/16:00221665 - isvavai.cz</a>
Result on the web
<a href="http://www.combinatorics.org/ojs/index.php/eljc/article/view/v23i1p2/pdf" target="_blank" >http://www.combinatorics.org/ojs/index.php/eljc/article/view/v23i1p2/pdf</a>
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
On Periodicity of Generalized Pseudostandard Words
Original language description
Generalized pseudostandard words were introduced by de Luca and De Luca in 2006. In comparison to the palindromic and pseudopalindromic closure, only little is known about the generalized pseudopalindromic closure and the associated generalized pseudostandard words. In this paper we provide a necessary and sufficient condition for their periodicity over binary and ternary alphabet. More precisely, we describe how the directive bi-sequence of a generalized pseudostandard word has to look like in order to correspond to a periodic word. We state moreover a conjecture concerning a necessary and sufficient condition for periodicity over any alphabet.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—

Project
<a href="/en/project/GA13-03538S" target="_blank" >GA13-03538S: Algorithms, Dynamics and Geometry of Numeration systems</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2016
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)