Automatic sequences of rank two

DOI10.1051/ita/2022006OpenAlexW3189147489MaRDI QIDQ5044415

Jason P. Bell, Jeffrey O. Shallit

Publication date: 31 October 2022

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

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

zbMATH Keywords

combinatorics on wordsautomatic sequenceprimitive wordrank two

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• An algorithm for enumerating all infinite repetitions in a D0L-system
• The equation \(a_ M=b^ Nc^ P\) in a free group
• Periodicity and ultimate periodicity of D0L systems
• An aperiodic set of 13 Wang tiles
• A small aperiodic set of Wang tiles
• The (generalized) Post correspondence problem with lists consisting of two words is decidable
• Logic and \(p\)-recognizable sets of integers
• Repetitiveness of languages generated by morphisms
• Decision problems for semi-Thue systems with a few rules
• Characterization of circular D0L-systems
• Repetition of subwords in DOL languages
• A DECISION PROBLEM FOR ULTIMATELY PERIODIC SETS IN NONSTANDARD NUMERATION SYSTEMS
• On the periodicity of morphisms on free monoids
• A decision method for the recognizability of sets defined by number systems
• Automatic Sequences
• If a DOL language is k-power free then it is circular
• Decidability of periodicity for infinite words
• ENUMERATION AND DECIDABLE PROPERTIES OF AUTOMATIC SEQUENCES
• Decidability of the HD0L ultimate periodicity problem
• Subword Complexity and k-Synchronization
• Ultimate Periodicity of b-Recognisable Sets: A Quasilinear Procedure
• Uniform tag sequences
• A variant of a recursively unsolvable problem

This page was built for publication: Automatic sequences of rank two