Simple Search

Query:

Enter a query and click »Search«...

Format:

Display: entries per page entries

Zbl 1156.68043
Balková, L'ubom{\'\i}ra; Masáková, Zuzana
Palindromic complexity of infinite words associated with non-simple Parry numbers. (English)
[J] Theor. Inform. Appl. 43, No. 1, 145-163 (2009). ISSN 0988-3754; ISSN 1290-385X/e

Summary: We study the palindromic complexity of infinite words $u_\beta$, the fixed points of the substitution over a binary alphabet, $\varphi(0)=0^a1, \varphi(1)=0^b1$, with $a-1\geq b\geq 1$, which are canonically associated with quadratic non-simple Parry numbers $\beta$.

MSC 2000:: *68R15 Combinatorics on words
11A63 Radix representation

Keywords: palindromes; beta-expansions; infinite words

Comment on this Item PDF MathML XML ASCII DVI PS BibTeX Online Ordering Article Journal Journal

	Scientific prize winners of the ICM 2010
	Overhang
	Lie groups, physics and geometry. An introduction for physicists, engineers and chemists.

Simple Search

Zentralblatt MATH Berlin [Germany]