A more reasonable proof of Cobham's theorem
Formal Languages and Automata Theory
2018-01-23 v1
Abstract
We present a short new proof of Cobham's theorem without using Kronecker's approximation theorem, making it suitable for generalization beyond automatic sequences.
Cite
@article{arxiv.1801.06704,
title = {A more reasonable proof of Cobham's theorem},
author = {Thijmen J. P. Krebs},
journal= {arXiv preprint arXiv:1801.06704},
year = {2018}
}
Comments
3 pages