Independent numeration systems and syndeticity

DOI10.1016/S0304-3975(98)00035-8zbMATH Open0952.68073OpenAlexW2482394447MaRDI QIDQ1275464FDOQ1275464

Authors: Georges Hansel 

Publication date: 12 January 1999

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(98)00035-8

Recommendations

• An extension of the Cobham-Semënov Theorem
• Towards a theorem of Cobham for Gaussian integers
• Cobham's Theorem seen through Büchi's Theorem
• scientific article; zbMATH DE number 1929973

zbMATH Keywords

finite automatonnumeration systemsCobham's theorem

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Radix representation; digital problems (11A63)

Cites Work

• Title not available (Why is that?)
• Logic and \(p\)-recognizable sets of integers
• On the base-dependence of sets of numbers recognizable by finite automata
• Bertrand numeration systems and recognizability
• Presburger arithmetic and recognizability of sets of natural numbers by automata: New proofs of Cobham's and Semenov's theorems
• How to write integers in a non-integral basis
• Title not available (Why is that?)
• An extension of the Cobham-Semënov Theorem

Cited In (9)

• Self-similar tiling systems, topological factors and stretching factors
• On recognizable sets of integers
• An asymptotic version of Cobham’s theorem
• An extension of the Cobham-Semënov Theorem
• Syndeticity and independent substitutions
• On multiplicatively dependent linear numeration systems, and periodic points
• Hybrid quasicrystals, transport and localization in products of minimal sets
• On multiplicative independent bases for canonical number systems in cyclotomic number fields
• Logical characterization of recognizable sets of polynomials over a finite field

This page was built for publication: Independent numeration systems and syndeticity

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