On the asymptotic average length of a maximum common subsequence for words over a finite alphabet

DOI10.1016/0304-3975(95)00259-6zbMath0871.68116OpenAlexW2055907875WikidataQ115926660 ScholiaQ115926660MaRDI QIDQ671435

Ioan Tomescu

Publication date: 27 February 1997

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

Full work available at URL: https://doi.org/10.1016/0304-3975(95)00259-6

zbMATH Keywords

asymptotic behaviouraverage lengthsubsequence of words

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Unnamed Item

This page was built for publication: On the asymptotic average length of a maximum common subsequence for words over a finite alphabet