Lyndon trees
type: Item
instance of: scholarly article
title: Lyndon trees
zbMATH Open document ID: 0787.68027
DOI: 10.1016/0304-3975(92)90259-I
author: K. G. Subramanian
author: Rani Siromoney
author: Lisa Mathew
published in: Theoretical Computer Science
publication date: 1993-04-22T00:00:00Z
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68P25
zbMATH DE Number: 109476
zbMATH Keywords: Lyndon trees
zbMATH Keywords: Lyndon words
zbMATH Keywords: factorization theorem
zbMATH Keywords: public key cryptosystem
MaRDI profile type: Publication
cites work: Factorizing words over an ordered alphabet
cites work: Q3673131
cites work: Q3785988
cites work: Q4529547
cites work: Lyndon Words, Free Algebras and Shuffles
cites work: On a public-key cryptosystem based on iterated morphisms and substitutions
cites work: A public key cryptosystem based on Lyndon words
cites work: A D0L-T0L public key cryptosystem
full work available at URL: 0304-3975(92)90259-i
OpenAlex ID: W2913062573
description: scientific article; zbMATH DE number 109476