On the size of the smallest alphabet for Lyndon trees

From MaRDI portal
Publication:2326391

DOI10.1016/j.tcs.2018.06.044zbMath1430.68255OpenAlexW2883931698WikidataQ129492867 ScholiaQ129492867MaRDI QIDQ2326391

Masayuki Takeda, Yuto Nakashima, Hideo Bannai, Takuya Takagi, Shunsuke Inenaga

Publication date: 7 October 2019

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2018.06.044




Related Items (1)




Cites Work




This page was built for publication: On the size of the smallest alphabet for Lyndon trees