Cobham’s Theorem and Automaticity

DOI10.1142/S0129054119500308zbMath1427.11029arXiv1809.00679OpenAlexW3003224523MaRDI QIDQ5207238

Manon Stipulanti, Narad Rampersad, Jeffrey O. Shallit, L. A. S. Mól

Publication date: 19 December 2019

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Automata sequences (11B85)

Related Items (2)

How to prove that a sequence is not automatic ⋮ Substitutive systems and a finitary version of Cobham's theorem

Cites Work

• Unnamed Item
• Automaticity. IV: Sequences, sets, and diversity
• Factors of generalised polynomials and automatic sequences
• Indian kolam patterns, sand drawings in the Vanuatu Islands, the Sierpiński curve, and monoid morphisms
• A Second Course in Formal Languages and Automata Theory
• A remark on morphic sturmian words
• Automatic Sequences
• Minimum complexity of automatic non sturmian sequences
• Uniform tag sequences
• A More Reasonable Proof of Cobham’s Theorem

This page was built for publication: Cobham’s Theorem and Automaticity