Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Znaleziono wyników: 1

Liczba wyników na stronie

Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

Syntactic Complexity of Ultimately Periodic Sets of Integers and Application to a Decision Procedure

Lacroix A., Rampersad N., Rigo M., Vandomme Ë.

Fundamenta Informaticae

2012

Vol. 116, nr 1-4

175-187

We compute the cardinality of the syntactic monoid of the language 0*rep_b(mN) made of base b expansions of the multiples of the integer m. We also give lower bounds for the syntactic complexity of any (ultimately) periodic set of integers written in base b. We apply our results to a well studied problem: decide whether or not a b-recognizable set of integers is ultimately periodic.