Lyndon heaps: An analogue of Lyndon words in free partially commutative monoids

Abstract

Given a free partially commutative monoid, we interpret equivalence classes of words (also called 'traces') in terms of Viennot's heaps of pieces. We study the notion of conjugacy applied to this context. Each heap has a unique representative in the set of'standard words' which are lexicographically ordered. Then, by definition, Lyndon heaps are the minimal… (More)
DOI: 10.1016/0012-365X(94)00032-E

Topics

2 Figures and Tables

Slides referencing similar topics