Another Generalization of Abelian Equivalence: Binomial Complexity of Infinite Words

DOI10.1007/978-3-642-40579-2_23zbMath1325.68175OpenAlexW2095859848MaRDI QIDQ2849991

Pavel Salimov, Michel Rigo

Publication date: 20 September 2013

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://orbi.uliege.be/handle/2268/149313

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (5)

Cyclic Complexity of Words ⋮ Avoiding or Limiting Regularities in Words ⋮ Another generalization of abelian equivalence: binomial complexity of infinite words ⋮ On \(k\)-abelian palindromes ⋮ Avoiding 2-binomial squares and cubes

This page was built for publication: Another Generalization of Abelian Equivalence: Binomial Complexity of Infinite Words