Automaticity. IV: Sequences, sets, and diversity

DOI10.5802/jtnb.173zbMath0876.11010OpenAlexW1978277837MaRDI QIDQ679096

Jeffrey O. Shallit

Publication date: 26 November 1997

Published in: Journal de Théorie des Nombres de Bordeaux (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=JTNB_1996__8_2_347_0

zbMATH Keywords

finite automatondiversity\(k\)-automaticitycharacteristic sequence of the primesmeasure of automaticityMinsky Papert theorem

Mathematics Subject Classification ID

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

Related Items (9)

Transcendence of Sturmian or morphic continued fractions ⋮ How to prove that a sequence is not automatic ⋮ Indian kolam patterns, sand drawings in the Vanuatu Islands, the Sierpiński curve, and monoid morphisms ⋮ Generalizations of Douady’s magic formula ⋮ Badly approximable numbers, Kronecker's theorem, and diversity of Sturmian characteristic sequences ⋮ A conjecture of Dekking on the dimensions of the lower central series factors of a certain just infinite Lie algebra ⋮ Block-counting sequences are not purely morphic ⋮ (Non)Automaticity of number theoretic functions ⋮ Cobham’s Theorem and Automaticity

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Real numbers with bounded partial quotients: A survey
• Automaticity. III: Polynomial automaticity and context-free languages
• Substitution invariant cutting sequences
• Automaticity. II: Descriptional complexity in the unary case
• Automaticity. I: Properties of a measure of descriptional complexity
• A relative of the Thue-Morse sequence
• On a characterization of the nonregular set of primes
• Approximate formulas for some functions of prime numbers
• On successive settings of an arc on the circumference of a circle
• A Time Complexity Gap for Two-Way Probabilistic Finite-State Automata
• The least square-free number in an arithmetic progression.
• Sharper Bounds for the Chebyshev Functions θ(x) and ψ(x). II
• Greatest of the Least Primes in Arithmetic Progressions Having a Given Modulus
• Zero-Free Regions for Dirichlet L-Functions, and the Least Prime in an Arithmetic Progression
• On the Recognition of Primes by Automata
• Unrecognizable Sets of Numbers
• Uniform tag sequences

This page was built for publication: Automaticity. IV: Sequences, sets, and diversity