IJPAM: Volume 101, No. 7 (2015)

PERIODICITY IN PARTIAL ARRAYS

S. Vijayachitra$^1$, K. Sasikala$^2$
$^1$Research Scholar
Sathyabama University
Chennai, INDIA
$^2$St. Joseph's College of Engineering
Chennai, INDIA


Abstract. A word of length $n$ over a finite alphabet $\Sigma$ is a map from $\{0, 1, 2, \dots, n-1\}$ into $\Sigma$. A partial word of length $n$ over $\Sigma$ is a partial map from $\{0, 1, 2, \dots, n-1\}$ into $\Sigma$, elements of $\{0, 1, 2, \dots, n-1\}$ without images are called holes. The fundamental periodicity result on words due to Fine and Wilf (1999) extended to partial words with two or three holes. This study was initiated by Berstel and Boasson for partial words, is motivated by molecular biology. This paper extends the result of periodicity to partial array.

Received: March 12, 2015

AMS Subject Classification: 68R15

Key Words and Phrases: word, partial word, partial array, periodicity

Download paper from here.



DOI: 10.12732/ijpam.v101i7.6 How to cite this paper?

Source: International Journal of Pure and Applied Mathematics
ISSN printed version: 1311-8080
ISSN on-line version: 1314-3395
Year: 2015
Volume: 101
Issue: 7
Pages: 647 - 653


Google Scholar; DOI (International DOI Foundation); WorldCAT.

CC BY This work is licensed under the Creative Commons Attribution International License (CC BY).