在所有可辨认的东西上
Sur les ensembles d'entiers reconnaissables
摘要：
设U和V是两个Bertrand数制，a和b是两个自然关联的帕里数。假设它们是乘法独立的。证明了：如果E是U和V都可识别的正整数子集，则E是算术级数的有限并.
英文摘要：
Let U and V be two Bertrand numeration systems, and, a and b the two Parry numbers there are naturally associated with. Suppose they are multiplicatively independent. We prove that, if E is a subset of positive integers which is both U and V recognizable, then E is a finite union of arithmetical progressions.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
