Computing the \(k\)-binomial complexity of the Thue-Morse word

DOI10.1007/978-3-030-24886-4_21OpenAlexW3039087745MaRDI QIDQ5919664

Michel Rigo, Marie Lejeune, Julien Leroy

Publication date: 15 October 2019

Published in: Developments in Language Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1812.07330

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (7)

Scattered Factor-Universality of Words ⋮ Longest Common Subsequence with Gap Constraints ⋮ Subsequences in bounded ranges: matching and analysis problems ⋮ Absent subsequences in words ⋮ Unnamed Item ⋮ Computing the \(k\)-binomial complexity of the Thue-Morse word ⋮ Templates for the \(k\)-binomial complexity of the Tribonacci word

This page was built for publication: Computing the \(k\)-binomial complexity of the Thue-Morse word