Calculation of the complexities of substitutive sequences over a binary alphabet

DOI10.1360/N012018-00269MaRDI QIDQ5064032FDOQ5064032

Authors: Bo Tan, Zhixiong Wen, Yiping Zhang 

Publication date: 21 March 2022

Published in: SCIENTIA SINICA Mathematica (Search for Journal in Brave)

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

Recommendations

• Automata calculating the complexity of automatic sequences
• Some properties of substitutive words
• Reconnaissabilité des substitutions et complexité des suites automatiques
• Asymptotic subword complexity of fixed points of group substitutions
• Complexity and special factors

zbMATH Keywords

complexitysubstitutionspecial word

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Cited In (4)

• The complexity of finding SUBSEQ\((A)\)
• Complexity and special factors
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: Calculation of the complexities of substitutive sequences over a binary alphabet

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