Palindromically rich GT-words

Glen, A.ORCID: 0000-0002-9434-3412 (2014) Palindromically rich GT-words. In: 38th Australasian Conference on Combinatorial Mathematics & Combinatorial Computing (38ACCMCC), 1 - 5 December, Wellington, New Zealand.

Abstract

Generalized trapezoidal words (or GT-words for short) were introduced by A. Glen and F. Leve in 2011. This new class of words naturally extends to an arbitrary finite alphabet the family of binary trapezoidal words that were originally introduced and studied by A. de Luca in 1999. Here, we completely describe all GT-words that are "rich" in palindromes, i.e., those
that contain the maximal number of distinct palindromic factors.

Item Type:	Conference Item
Murdoch Affiliation(s):	School of Engineering and Information Technology
URI:	http://researchrepository.murdoch.edu.au/id/eprint/28083

Item Control Page

Downloads