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 some well studied problem: decide whether or not a brecognizable sets of integers is ultimately periodic.

Using a genealogically ordered infinite regular language, we know how to represent an interval ofR. Numbers having an ultimately periodic representation play a special role in classical numeration systems. The aim of this paper is to characterize the numbers having an ultimately periodic representation in generalized systems built on a regular language. The syntactical properties of these words...

In this paper, I argue that the ultimate argument for Scientific Realism, also known as the No-Miracles Argument (NMA), ultimately fails as an abductive defence of Epistemic Scientific Realism (ESR), where (ESR) is the thesis that successful theories of mature sciences are approximately true. The NMA is supposed to be an Inference to the Best Explanation (IBE) that purports to explain the succe...

Speed-accuracy trade-offs strongly influence the rate of reward that can be earned in many decision-making tasks. Previous reports suggest that human participants often adopt suboptimal speed-accuracy trade-offs in single session, two-alternative forced-choice tasks. We investigated whether humans acquired optimal speed-accuracy trade-offs when extensively trained with multiple signal qualities...