• Aucun résultat trouvé

Structural properties of bounded languages with respect to multiplication by a constant

N/A
N/A
Protected

Academic year: 2021

Partager "Structural properties of bounded languages with respect to multiplication by a constant"

Copied!
1
0
0

Texte intégral

(1)

Structural Properties of bounded Languages with Respect

to Multiplication by a Constant

Emilie Charlier Institut de mathématique Grande Traverse, 12 B-4000 Liège Belgique echarlier@ulg.ac.be

Generalizations of positional number systems in which N is recognizable by finite automata are obtained by describing an arbitrary infinite regular language according to the genealogical ordering. More precisely, an abstract numeration system is a triple S = (L, Σ, <) where L is an infinite language over the totally ordered alphabet (Σ, <). Enumerating the elements of L genealogically with respect to < leads to a one-to-one map rS from N onto L. To any natural

number n, it assigns the (n + 1)th word of L, its S-representation, while the inverse map valS sends any word belonging to L onto its numerical value. A

subset X is said to be S-recognizable if rS(X) is a regular subset of L. We study

the preservation of recognizability of a set of integers after multiplication by a constant for abstract numeration systems built over a bounded language.

Références

Documents relatifs

C (2) dans le cycle imidazolium conduit à une variation très significative des propriétés macroscopiques, cette méthylation de la position C (2) des liquides

We consider in ultrahyperbolic Clifford analysis, [1], [5], [6], the rep- resentation of a k-vector function F : Ω → Cl k p,q , with 0 &lt; k &lt; n, in terms of functions

Quite to the contrary, the reduction in coordination of the a-Si:H samples closely reflects the presence of hydrogen, which does not contribute to the EXAFS signal..

In the particular case s = 1 the s-perimeter coincides with the classical perimeter, and our results improve the ones of Kn¨ upfer and Muratov [25, 26] concerning minimality of balls

Although the existence of a modeling FO-limit for FO-convergent sequences of graphs with bounded tree-depth follows easily from our study of FO-convergent sequence of rooted

In ultra high Rayleigh numbers ( Ra &gt; 10 16 ) experiments in He, one of the stratification criteria, scaling with α ∆ h , could be violated. This criterion garanties that

[r]

For the streaming setting, if we consider 0-lookahead repair strategies with aggregate cost, the threshold problem becomes solvable in polynomial time (hence it is as difficult as