On a new notion of complexity on infinite words

zbMATH Open1235.68120MaRDI QIDQ3104341FDOQ3104341

Authors: Julien Cassaigne, Idrissa Kaboré, Théodore Tapsoba 

Publication date: 19 December 2011

Recommendations

• A new complexity function for words based on periodicity
• Cyclic complexity of words
• Complexity for finite factors of infinite sequences
• Topological invariants for words of linear factor complexity
• scientific article; zbMATH DE number 1948496

zbMATH Keywords

window complexity

Mathematics Subject Classification ID

Combinatorics on words (68R15) Automata sequences (11B85)

Cited In (9)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On complexity functions of infinite words associated with generalized Dyck languages
• Topological invariants for words of linear factor complexity
• ON THE PALINDROMIC COMPLEXITY OF INFINITE WORDS
• On the complexity functions of Sturmian words
• A new complexity function for words based on periodicity
• On the Lie complexity of Sturmian words

This page was built for publication: On a new notion of complexity on infinite words

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3104341)