| Autor: |
Arulprakasam, R., Kumari, R. Krishna, Janaki, K., Jeyanthi, L., Madhusoodhanan, P. |
| Předmět: |
|
| Zdroj: |
IAENG International Journal of Computer Science; Mar2024, Vol. 51 Issue 3, p282-291, 10p |
| Abstrakt: |
Lyndon words have been extensively studied in different contexts of free Lie algebra and combinatorics. All Lyndon and Nyldon words are primitive and any primitive class of words contains an unique Lyndon and an unique Nyldon word. This property motivated the study of Lyndon partial word which is primitive but all primitive classes of partial words may not contain a Lyndon partial word. In this paper we introduce two variants of Lyndon partial words namely Nyldon and inverse Lyndon partial words which are constructed from the decreasing alphabetical order. We compare the properties of the variants with those of Lyndon partial words. [ABSTRACT FROM AUTHOR] |
| Databáze: |
Supplemental Index |
| Externí odkaz: |
|
