|
| << previous | next >> |
Journal description
All volumes of the corresponding journal
All issues of the corresponding volume
All articles of the corresponding issues
Details for article 19 of 22 found articles
| Title: |
Syntactic Complexity of Ultimately Periodic Sets of Integers and Application to a Decision Procedure |
| Author: |
Lacroix, Anne Rampersad, Narad Rigo, Michel Vandomme, Élise |
| Appeared in: |
Fundamenta informaticae |
| Paging: | Volume 116 (2012) nr. 1-4 pages 175-187 |
| Year: |
2012-05-16 |
| Contents: |
We compute the cardinality of the syntactic monoid of the language 0* repb(m$\mathbb{N}$) 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. |
| Publisher: |
IOS Press |
| Source file: |
Elektronische Wetenschappelijke Tijdschriften |
Details for article 19 of 22 found articles
| << previous | next >> |