• Aucun résultat trouvé

[PDF] Top 20 Automatic sequences based on Parry or Bertrand numeration systems

Has 10000 "Automatic sequences based on Parry or Bertrand numeration systems" found on our website. Below are the top 20 most common "Automatic sequences based on Parry or Bertrand numeration systems".

Automatic sequences based on Parry or Bertrand numeration systems

Automatic sequences based on Parry or Bertrand numeration systems

... There exists a Bertrand-automatic sequence with superlinear factor complexity.. Adeline Massuir Parry-automatic 16/28..[r] ... Voir le document complet

105

Automatic sequences based on Parry or Bertrand numeration systems

Automatic sequences based on Parry or Bertrand numeration systems

... an automatic sequence is an infinite word over a finite alphabet such that its nth symbol is obtained as the output given by a deterministic finite automaton fed with the representation of n in a suitable ... Voir le document complet

15

Automatic sequences in rational base numeration systems (and even more)

Automatic sequences in rational base numeration systems (and even more)

... References ◦ A. Lepistö, On the power of periodic iteration of morphisms, ICALP 1993, 496–506, Lect. Notes Comp. Sci 700, (1993). ◦ J. Peltomäki, A. Massuir, and M. Rigo, Automatic sequences based ... Voir le document complet

41

A decision problem for ultimately periodic sets in non-standard numeration systems

A decision problem for ultimately periodic sets in non-standard numeration systems

... linear numeration system such that N is U - recognizable and satisfying a recurrence relation of order k of the kind (1) with a k = ±1 and lim i→+∞ U i+1 − U i = ...whether or not a U - recognizable set is ... Voir le document complet

2

A decision problem for ultimately periodic sets in non-standard numeration systems

A decision problem for ultimately periodic sets in non-standard numeration systems

... linear numeration system such that N is U -recognizable and satisfying a relation like (1) with a k = ±1 (the main reason for this assumption is that 1 and −1 are the only two integers invertible modulo n for all ... Voir le document complet

13

Closed, Palindromic, Rich, Privileged, Trapezoidal, and Balanced Words in Automatic Sequences

Closed, Palindromic, Rich, Privileged, Trapezoidal, and Balanced Words in Automatic Sequences

... for automatic (and some related) ...an automatic sequence x has a closed ...famous sequences, such as the Thue-Morse sequence, the Rudin-Shapiro sequence, the ordinary paperfolding sequence, the ... Voir le document complet

20

A decision problem for ultimately periodic sets in non-standard numeration systems

A decision problem for ultimately periodic sets in non-standard numeration systems

... Jason Bell 1 Emilie Charlier 2 Avierzri Fraenkel 3 Michel Rigo 2.. 1 Department of Mathematics.[r] ... Voir le document complet

28

Concurrent Systems Need Both Sequences And Serializers

Concurrent Systems Need Both Sequences And Serializers

... DRAFT February 1979 26 Sequences and Serializers The above definition shows how serializers subsume the ability of cells to efficiently implement synchronization and s[r] ... Voir le document complet

36

Confluent Parry numbers, their spectra,  and integers in positive- and negative-base  number systems

Confluent Parry numbers, their spectra, and integers in positive- and negative-base number systems

... where d ≥ 1, m ≥ n ≥ 1. Their significance was first observed by Frougny in [14] who shows that the corresponding linear numeration system is con- fluent. We present the formulation using the spectrum X(β), for ... Voir le document complet

25

A decision problem for ultimate periodicity in non-standard numeration systems

A decision problem for ultimate periodicity in non-standard numeration systems

... Theorem (Muchnik 1991) The ultimate periodicity problem is decidable for all NS with a regular numeration language, provided that addition is recognizable. Example ( U i+4 = 3U i+3 + 2U i+2 + 3U i for all i ≥ 0 , ... Voir le document complet

27

Abstract numeration systems on bounded languages and multiplication by a constant

Abstract numeration systems on bounded languages and multiplication by a constant

... −→ B ℓ Thus the multiplication by λ = 25 induces a mapping f λ onto B 2 such that for w, w ′ ∈ B 2 , f λ (w) = w ′ if and only if val 2 (w ′ ) = 25 val 2 (w). This paper is organized as follows. In Section 2, we recall a ... Voir le document complet

20

Generating Test Sequences to Assess the Performance of Elastic Cloud-based Systems

Generating Test Sequences to Assess the Performance of Elastic Cloud-based Systems

... is based on previous work on modeling [18] and generating test cases [22], [21] for ...software systems. In this paper, we propose a graph-based algorithm to select ... Voir le document complet

9

remediation2010 numeration cm2

remediation2010 numeration cm2

... -nombres décimaux : désignations orales et écritures chiffrées, valeur des chiffres en fonction de leur position, passage de l’écriture à virgule à une écriture fractionnaire et inverse[r] ... Voir le document complet

3

The reliability of automatic sprinkler systems

The reliability of automatic sprinkler systems

... operating or when there is a problem with a water supply source, such as decreased water level in a storage tank or a significant drop in water ...these systems can be further improved by having ... Voir le document complet

5

Automatic software upgrades for distributed systems

Automatic software upgrades for distributed systems

... Incremental TFs make sense for state that has many independent pieces (e.g., files in a file system, records in a database, or objects in an OODB) that can each[r] ... Voir le document complet

164

An automatic model-to-model mapping and transformation methodology to serve model-based systems engineering

An automatic model-to-model mapping and transformation methodology to serve model-based systems engineering

... The first matching step focuses on detecting matching pairs of elements. If two elements coming from the source model and the target model stand for the same (or similar) concept(s) (shared parts on the meta-model ... Voir le document complet

55

An automatic grader for embedded systems education

An automatic grader for embedded systems education

... 1 Introduction In this thesis, we describe a software tool (“MicroGrader”) for grading embedded sys- tems exercises in an educational setting. Specifically, we focus on assessing the degree to which a student’s ... Voir le document complet

66

Tilings for Pisot beta numeration

Tilings for Pisot beta numeration

... The aim of the present paper is to study tilings associated with beta numeration in the context of Pisot numbers that are not necessarily units. The space where these tilings are represented consists of a suitable ... Voir le document complet

30

Spectral two-level preconditioners for sequences of linear systems

Spectral two-level preconditioners for sequences of linear systems

... of sequences of linear systems with the same coeffi- cient matrix but different right-hand ...schemes, or in developing new preconditioning techniques or in combining the two ...where ... Voir le document complet

112

Holonomic systems and automatic proofs of identities

Holonomic systems and automatic proofs of identities

... L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignemen[r] ... Voir le document complet

65

Show all 10000 documents...