Minimum complexity of automatic non sturmian sequences

DOI10.1051/ITA/1995290402851zbMATH Open0838.68057OpenAlexW1843278374MaRDI QIDQ4858845FDOQ4858845

Authors: Théodore Tapsoba 

Publication date: 20 December 1995

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/92510

Recommendations

• Sequences of low complexity: Automatic and Sturmian sequences
• Complexity of automatic sequences
• Complexity of automatic sequences
• On the \(N\)th linear complexity of automatic sequences
• Automatic complexity of shift register sequences
• The complexity of generalized Sturmian sequences
• Hopcroft's automaton minimization algorithm and Sturmian words
• On the joint subword complexity of automatic sequences
• Automata calculating the complexity of automatic sequences
• A generalization of automatic sequences

zbMATH Keywords

automatic non Sturmian sequences

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Cites Work

• Suites algébriques, automates et substitutions
• Uniform tag sequences
• Automates finis et ensembles normaux. (Finite automata and normal sets)
• Sequences with minimal block growth
• Title not available (Why is that?)
• Title not available (Why is that?)
• Automata calculating the complexity of automatic sequences
• Special factors of automatic sequences

Cited In (5)

• How to prove that a sequence is not automatic
• Automatic complexity of shift register sequences
• Hidden automatic sequences
• Cobham’s Theorem and Automaticity
• Complexity of automatic sequences

This page was built for publication: Minimum complexity of automatic non sturmian sequences

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