当前位置: X-MOL 学术Int. J. Found. Comput. Sci. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
A More Reasonable Proof of Cobham’s Theorem
International Journal of Foundations of Computer Science ( IF 0.8 ) Pub Date : 2021-02-01 , DOI: 10.1142/s0129054121500118
Thijmen J. P. Krebs 1
Affiliation  

We present a short proof of Cobham’s theorem without using Kronecker’s approximation theorem, making it suitable for generalization beyond automatic sequences.

中文翻译:

Cobham定理的一个更合理的证明

我们在不使用 Kronecker 逼近定理的情况下给出了 Cobham 定理的简短证明,使其适用于自动序列之外的泛化。
更新日期:2021-02-01
down
wechat
bug