Autor: |
Jansirani, N., Vigneswaran, L., Dare, V. R. |
Předmět: |
|
Zdroj: |
AIP Conference Proceedings; 9/8/2022, Vol. 2529 Issue 1, p1-10, 10p |
Abstrakt: |
The two famous infinite sequences Fibonacci and Kolakoski introduced by Leonardo Pisano Fibonacci and William George Kolakoski provide many combinatorial properties also both sequences describe genetic code and DNA in the biological systems. An infinite Kolakoski sequence of strings 풦(i,j), how it can be generated with Golden proportion ɸ is explained and the difference equation of 풦(i, j) is established from the recurrence relation of 풦(i, j) for every n∈N. The palindrome density dp[풦(i, j)] of 풦 is obtained and an algorithm is designed to identify the total number of preceding palindromes of 풦(i,j) for any n∈N. Further the combinatorial properties are obtained with respect to the length 2 ≤ |w| ≤ 5 of the string 풦(i, j). Also an application of non-palindrome string of 풦(i, j) in encryption and decryption analysis is shown. [ABSTRACT FROM AUTHOR] |
Databáze: |
Complementary Index |
Externí odkaz: |
|