A note on syndeticity, recognizable sets and Cobham's theorem

Details A note on syndeticity, recognizable sets and Cobham's theorem A note on syndeticity, recognizable sets and Cobham's theorem

2009-07-03

arxiv.org/abs/0907.0624v1

Bull. Eur. Assoc. Theor. Comput. Sci. EATCS 88 (2006), 169-173

Computer Science

Formal Languages and Automata Theory

Scientific paper

In this note, we give an alternative proof of the following result. Let p, q >= 2 be two multiplicatively independent integers. If an infinite set of integers is both p- and q-recognizable, then it is syndetic. Notice that this result is needed in the classical proof of the celebrated Cobham?s theorem. Therefore the aim of this paper is to complete [13] and [1] to obtain an accessible proof of Cobham?s theorem.

Affiliated with

Also associated with

No associations

Rating

A note on syndeticity, recognizable sets and Cobham's theorem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A note on syndeticity, recognizable sets and Cobham's theorem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A note on syndeticity, recognizable sets and Cobham's theorem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-706001