Artigo
Acesso aberto
Revisado por pares
Recurrent words with constant Abelian complexity
2010; Elsevier BV; Volume: 47; Issue: 1 Linguagem: Inglês
10.1016/j.aam.2010.05.001
ISSN1090-2074
AutoresJames D. Currie, Narad Rampersad,
Tópico(s)DNA and Biological Computing
ResumoWe prove the non-existence of recurrent words with constant Abelian complexity containing four or more distinct letters. This answers a question of Richomme et al.
Referência(s)