Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
162 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

A more reasonable proof of Cobham's theorem (1801.06704v1)

Published 20 Jan 2018 in cs.FL

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.

Citations (6)

Summary

We haven't generated a summary for this paper yet.