On the Cobham-Semenov theorem
From MaRDI portal
Publication:675868
Cited in
(7)- Cobham’s Theorem and Automaticity
- Numeration systems on a regular language: Arithmetic operations, recognizability and formal power series
- Cobham's Theorem seen through Büchi's Theorem
- An asymptotic version of Cobham’s theorem
- On Sevast'yanov's theorem
- Bertrand numeration systems and recognizability
- On recognizable sets of integers
This page was built for publication: On the Cobham-Semenov theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q675868)