Ultimate periodicity of b-recognisable sets : a quasilinear procedure

It is decidable if a set of numbers, whose representation in a base b is a regular language, is ultimately periodic. This was established by Honkala in 1986. We give here a structural description of minimal automata that accept an ultimately periodic set of numbers. We then show that it can verified in linear time if a given minimal automaton meets this description. This thus yields a O(n log(n)) procedure for deciding whether a general deterministic automaton accepts an ultimately periodic set of numbers.Comment: presented at DLT 201

Trees with Given Stability Number and Minimum Number of Stable Sets

We study the structure of trees minimizing their number of stable sets for given order $n$ and stability number $\alpha$. Our main result is that the edges of a non-trivial extremal tree can be partitioned into $n-\alpha$ stars, each of size $\lceil \frac{n-1}{n-\alpha} \rceil$ or $\lfloor \frac{n-1}{n-\alpha}\rfloor$, so that every vertex is included in at most two distinct stars, and the centers of these stars form a stable set of the tree.Comment: v2: Referees' comments incorporate

Formation of a metastable nanostructured mullite during Plasma Electrolytic Oxidation of aluminium in “soft” regime condition

International audienceThis paper demonstrates the possibility of producing a lamellar ceramic nanocomposite at the topmost surface of oxide coatings grown with the Plasma Electrolytic Oxidation process (PEO). PEO was conducted on aluminium in a silicate-rich electrolyte under the so-called "soft" regime. Nanoscale characterisation showed that the transition from the "arcs" to the "soft" regime was concomitant with the gradual formation of a 1:1 mullite/alumina lamellar nanocomposite (≈120 nm thick) that filled the cavity of the PEO "pancake" structure. Combined with plasma diagnostic techniques, a three-step growth mechanism was proposed: (i) local melting of alumina under the PEO micro-discharges (≈3200 K at high heating rate ≈3 × 10 8 K·s −1); (ii) progressive silicon enrichment of the melt coming from the electrolyte; and (iii) quenching of the melt at a cooling rate of ≈3.3 × 10 7 K·s −1 as the micro-discharge extinguishes. Under such severe cooling conditions, the solidification process was non-equilibrium as predicted by the metastable SiO 2-Al 2 O 3 binary phase diagram. This resulted in phase separation where pure alumina lamellae alternate periodically with 1:1 mullite lamellae

Deposition rate controls nucleation and growth during amorphous/nanocrystalline competition in sputtered Zr-Cr thin films

Dual-phase Zr-based thin films synthesized by magnetron co-sputtering and showing competitive growth between amorphous and crystalline phases have been reported recently. In such films, the amorphous phase grows as columns, while the crystalline phase grows as separated cone-shaped crystalline regions made of smaller crystallites. In this paper, we investigate this phenomenon and propose a model for the development of the crystalline regions during thin film growth. We evidence using X-ray diffraction (XRD), scanning electron microscopy (SEM) and transmission electron microscopy (TEM), that this competitive selfseparation also exists in co-sputtered Zr-Cr thin films with Cr contents of ~84-86 at.%, corresponding to the transition between the amorphous and crystalline compositions, and in the Zr-V system. Then, to assess the sturdiness of this phenomenon, its existence and geometrical characteristics are evaluated when varying the film composition and the deposition rate. The variation of geometrical features, such as the crystalline cone angle, the size and density of crystallites, is discussed. Is it shown that a variation in the deposition rate changes the nucleation and growth kinetics of the crystallites. The surface coverage by the crystalline phase at a given thickness is also calculated for each deposition rate. Moreover, comparison is made between Zr-Cr, Zr-V, Zr-Mo and Zr-W dual-phase thin films to compare their nucleation and growth kinetics

On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases

This article studies the expressive power of finite automata recognizing sets of real numbers encoded in positional notation. We consider Muller automata as well as the restricted class of weak deterministic automata, used as symbolic set representations in actual applications. In previous work, it has been established that the sets of numbers that are recognizable by weak deterministic automata in two bases that do not share the same set of prime factors are exactly those that are definable in the first order additive theory of real and integer numbers. This result extends Cobham's theorem, which characterizes the sets of integer numbers that are recognizable by finite automata in multiple bases. In this article, we first generalize this result to multiplicatively independent bases, which brings it closer to the original statement of Cobham's theorem. Then, we study the sets of reals recognizable by Muller automata in two bases. We show with a counterexample that, in this setting, Cobham's theorem does not generalize to multiplicatively independent bases. Finally, we prove that the sets of reals that are recognizable by Muller automata in two bases that do not share the same set of prime factors are exactly those definable in the first order additive theory of real and integer numbers. These sets are thus also recognizable by weak deterministic automata. This result leads to a precise characterization of the sets of real numbers that are recognizable in multiple bases, and provides a theoretical justification to the use of weak automata as symbolic representations of sets.Comment: 17 page

Language Emptiness of Continuous-Time Parametric Timed Automata

Parametric timed automata extend the standard timed automata with the possibility to use parameters in the clock guards. In general, if the parameters are real-valued, the problem of language emptiness of such automata is undecidable even for various restricted subclasses. We thus focus on the case where parameters are assumed to be integer-valued, while the time still remains continuous. On the one hand, we show that the problem remains undecidable for parametric timed automata with three clocks and one parameter. On the other hand, for the case with arbitrary many clocks where only one of these clocks is compared with (an arbitrary number of) parameters, we show that the parametric language emptiness is decidable. The undecidability result tightens the bounds of a previous result which assumed six parameters, while the decidability result extends the existing approaches that deal with discrete-time semantics only. To the best of our knowledge, this is the first positive result in the case of continuous-time and unbounded integer parameters, except for the rather simple case of single-clock automata

Commentary: osteoarthritis of the knee and glucosamine

peer reviewe

Enumeration and Decidable Properties of Automatic Sequences

We show that various aspects of k-automatic sequences -- such as having an unbordered factor of length n -- are both decidable and effectively enumerable. As a consequence it follows that many related sequences are either k-automatic or k-regular. These include many sequences previously studied in the literature, such as the recurrence function, the appearance function, and the repetitivity index. We also give some new characterizations of the class of k-regular sequences. Many results extend to other sequences defined in terms of Pisot numeration systems