Overlaps in free partially commutative monoids
作者：
Highlights：
•
摘要
It is shown that the set of overlaps of a connected word in a free partially commutative monoid forms a lattice. In addition, a linear-time algorithm is presented for computing the maximum element of that lattice.
论文关键词：
论文评审过程：Received 12 May 1988, Revised 1 March 1989, Available online 3 December 2003.
论文官网地址：https://doi.org/10.1016/0022-0000(91)90010-3
