Towards a theorem of Cobham for Gaussian integers

zbMATH Open1071.68089MaRDI QIDQ1781924FDOQ1781924

Georges Hansel, Taoufik Safer

Publication date: 9 June 2005

Published in: Bulletin of the Belgian Mathematical Society - Simon Stevin (Search for Journal in Brave)

Full work available at URL: https://projecteuclid.org/euclid.bbms/1074791328

zbMATH Keywords

finite automataCobham theoremfour exponentials conjecturecomplex bases\(p\)-recognizability

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Combinatorics on words (68R15) Automata sequences (11B85)

Cited In (5)

• On Multiplicative Independent Bases for Canonical Number Systems in Cyclotomic Number Fields
• Multiplicative dependence of two integers shifted by a root of unity
• An asymptotic version of Cobham’s theorem
• On automatic subsets of the Gaussian integers
• A More Reasonable Proof of Cobham’s Theorem

Recommendations

• The Prouhet-Tarry-Escott problem for Gaussian integers 👍 👎
• On the set of divisors of Gaussian integers 👍 👎
• A structure theorem for multiplicative functions over the Gaussian integers and applications 👍 👎
• Fermat's Last Theorem for Gaussian Integer Exponents 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: Towards a theorem of Cobham for Gaussian integers

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