Results 1  10
of
12
Logic and precognizable sets of integers
 Bull. Belg. Math. Soc
, 1994
"... We survey the properties of sets of integers recognizable by automata when they are written in pary expansions. We focus on Cobham’s theorem which characterizes the sets recognizable in different bases p and on its generalization to N m due to Semenov. We detail the remarkable proof recently given ..."
Abstract

Cited by 70 (4 self)
 Add to MetaCart
(Show Context)
We survey the properties of sets of integers recognizable by automata when they are written in pary expansions. We focus on Cobham’s theorem which characterizes the sets recognizable in different bases p and on its generalization to N m due to Semenov. We detail the remarkable proof recently given by Muchnik for the theorem of CobhamSemenov, the original proof being published in Russian. 1
Automata techniques for query inference machines. Annals of pure and applied logic
, 1995
"... ..."
(Show Context)
A Survey of Arithmetical Definability
, 2002
"... We survey definability and decidability issues related to firstorder fragments of arithmetic, with a special emphasis on Presburger and Skolem arithmetic and their (un)decidable extensions. ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We survey definability and decidability issues related to firstorder fragments of arithmetic, with a special emphasis on Presburger and Skolem arithmetic and their (un)decidable extensions.
Almost Periodicity, Finite Automata Mappings and Related Effectiveness Issues
 Proceedings of WoWA’06, St
"... ..."
(Show Context)
Boolean Relation Theory and Incompleteness
 Lecture Notes in Logic, Association for Symbolic Logic
"... ..."
Abstract
"... In prior papers the following question was considered: which classes of computable sets can be learned if queries about those sets can be asked by the learner? The answer depended on the query language chosen. In this paper we develop a framework (reductions) for studying this question. Essentially, ..."
Abstract
 Add to MetaCart
(Show Context)
In prior papers the following question was considered: which classes of computable sets can be learned if queries about those sets can be asked by the learner? The answer depended on the query language chosen. In this paper we develop a framework (reductions) for studying this question. Essentially, once we have a result for queries to [S, <] 2, we can obtain the same result for many different languages. We obtain easier proofs of old results and several new results. An earlier result we have an easier proof of: the set of computable sets cannot be learned with queries to the language [+, <] (in notation: COMP / ∈ QEX[+, <]). A new result: the set of computable sets cannot be learned with queries to the language [+, <, POWa] where
Automata and Numeration Systems
"... This article is a short survey on the following problem: given a set X ` ..."
(Show Context)