Add to ORKGABSTRACT. The concept of logsets is introduced into set theory and the consequences explained. It is shown that logsets generate an infinite set of sequences of decreasin
Introduction. Numeration, or code, discrete sequences act fundamental part in the theory of recognit...
A combinatorial lemma is proved and used here to derive new results on ω-automata and to give simple...
AbstractA numeration system is a sequence of integers such that any integer can be represented by me...
AbstractThe aim of this paper is to study what the accelerable subsets of LOGSF of all logarithmical...
Abstract. We present a first-order theory of (finite) sequences with integer el-ements, Presburger a...
A class of recursively defined sets of integers is investigated. Their asymptotic densities and reco...
The theorem of Büchi-Bruyère states that a subset of N^d is b-recognizable if and only if it is b-de...
Let L be an infinite regular language on a totally ordered alphabet (Σ,<). Feeding a finite determin...
AbstractLet L be an infinite regular language on a totally ordered alphabet (Σ,<). Feeding a finite ...
2014 – 04 – 03 We present here the notion of breadth-first signature and its relationship with numer...
Increasing integer sequences include many instances of interesting sequences and combinatorial struc...
AbstractIn this paper, numeration systems defined by recurrent sequences are considered. We present ...
AbstractA class of recursively defined sets of integers is investigated. Their asymptotic densities ...
In this paper, numeration systems defined by recurrent sequences are considered. We present a class ...
Abstract. The notions of “labelled set ” and “numerosity ” are introduced to generalize the counting...
Introduction. Numeration, or code, discrete sequences act fundamental part in the theory of recognit...
A combinatorial lemma is proved and used here to derive new results on ω-automata and to give simple...
AbstractA numeration system is a sequence of integers such that any integer can be represented by me...
AbstractThe aim of this paper is to study what the accelerable subsets of LOGSF of all logarithmical...
Abstract. We present a first-order theory of (finite) sequences with integer el-ements, Presburger a...
A class of recursively defined sets of integers is investigated. Their asymptotic densities and reco...
The theorem of Büchi-Bruyère states that a subset of N^d is b-recognizable if and only if it is b-de...
Let L be an infinite regular language on a totally ordered alphabet (Σ,<). Feeding a finite determin...
AbstractLet L be an infinite regular language on a totally ordered alphabet (Σ,<). Feeding a finite ...
2014 – 04 – 03 We present here the notion of breadth-first signature and its relationship with numer...
Increasing integer sequences include many instances of interesting sequences and combinatorial struc...
AbstractIn this paper, numeration systems defined by recurrent sequences are considered. We present ...
AbstractA class of recursively defined sets of integers is investigated. Their asymptotic densities ...
In this paper, numeration systems defined by recurrent sequences are considered. We present a class ...
Abstract. The notions of “labelled set ” and “numerosity ” are introduced to generalize the counting...
Introduction. Numeration, or code, discrete sequences act fundamental part in the theory of recognit...
A combinatorial lemma is proved and used here to derive new results on ω-automata and to give simple...
AbstractA numeration system is a sequence of integers such that any integer can be represented by me...