Lyndon trees

DOI10.1016/0304-3975(92)90259-IMaRDI QIDQ1202932zbMATH OpenOpenAlexFDO

Authors K. G. Subramanian, Rani Siromoney, Lisa Mathew

Publication date 22 April 1993

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-3975(92)90259-i

zbMATH Keywords

public key cryptosystemLyndon wordsfactorization theoremLyndon trees

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Data encryption (aspects in computer science) (68P25) Data structures (68P05)

Recommendations

• Clouds over a public key cryptosystem based on Lyndon words
• Transfinite Lyndon words
• A public key cryptosystem based on Lyndon words
• Linear construction of a left Lyndon tree
• Génération d'une section des classes de conjugaison et arbre des mots de Lyndon de longueur bornée. (Generation of a section of conjugation classes and trees of Lyndon words of bounded length)

Cites work

• scientific article; zbMATH DE number 3827231 (Why is no real title available?)
• scientific article; zbMATH DE number 4049099 (Why is no real title available?)
• scientific article; zbMATH DE number 1737190 (Why is no real title available?)
• A D0L-T0L public key cryptosystem
• A public key cryptosystem based on Lyndon words
• Factorizing words over an ordered alphabet
• Lyndon Words, Free Algebras and Shuffles
• On a public-key cryptosystem based on iterated morphisms and substitutions

Cited in

(5)

• scientific article; zbMATH DE number 3913711 (Why is no real title available?)
• Lyndon partial words and arrays with applications
• Periodicities on trees
• McKay trees
• Cartesian and Lyndon trees

This page was built for publication: Lyndon trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1202932)