We say a finite word x is a palindromic periodicity if there exist two palindromes p and s such that |x| ≥ |ps| and x is a prefix of the infinite periodic word (ps)^ω = pspsps⋯. In this paper we examine the palindromic periodicities occurring in some classical infinite words, such as Sturmian words, episturmian words, the Thue-Morse word, the period-doubling word, the Rudin-Shapiro word, the paperfolding word, and the Tribonacci word, and prove a number of results about them. We also prove results about words with the smallest number of distinct palindromic periodicities.

Visual programming languages are commonplace in engaging novice programmers. Accessibility challenges persist in these systems. This study investigates whether auditory cues improves a visually impaired programmer's ability to navigate and understand source code in a block-based language. The type of auditory cue that best serves this purpose is also investigated. The participants' comprehension of source code using three trials with two tests each is presented, with each trial corresponding to a different form of audio cue. Participants are graded on how accurate their written source code is in comparison to the actual source code.