Asymptotic behaviour of bi-infinite words
We present a description of asymptotic behaviour of languages of bi-infinite words obtained by iterating morphisms defined on free monoids.
Asymptotic classification of aliasing structures.
Asymptotic distributions and chaos for the supermarket model.
Asymptotic normality of recursive algorithms via martingale difference arrays.
Asymptotic spectral analysis of generalized Erdős-Rényi random graphs
Motivated by the Watts-Strogatz model for a complex network, we introduce a generalization of the Erdős-Rényi random graph. We derive a combinatorial formula for the moment sequence of its spectral distribution in the sparse limit.
Asymptotical behaviour of some non-uniform measures
Asynchronous serioparallel execution of the loop
Asynchronous sliding block maps
Asynchronous sliding block maps
We define a notion of asynchronous sliding block map that can be realized by transducers labeled in A* × B*. We show that, under some conditions, it is possible to synchronize this transducer by state splitting, in order to get a transducer which defines the same sliding block map and which is labeled in A × Bk, where k is a constant integer. In the case of a transducer with a strongly connected graph, the synchronization process can be considered as an implementation of an algorithm of...
Atomistic to Continuum limits for computational materials science
The present article is an overview of some mathematical results, which provide elements of rigorous basis for some multiscale computations in materials science. The emphasis is laid upon atomistic to continuum limits for crystalline materials. Various mathematical approaches are addressed. The setting is stationary. The relation to existing techniques used in the engineering literature is investigated.
Atoms and partial orders of infinite languages
We determine minimal elements, i.e., atoms, in certain partial orders of factor closed languages under . This is in analogy to structural Ramsey theory which determines minimal structures in partial orders under embedding.
Atoms and partial orders of infinite languages
We determine minimal elements, i.e., atoms, in certain partial orders of factor closed languages under ⊆. This is in analogy to structural Ramsey theory which determines minimal structures in partial orders under embedding.
Atoms in the structure of degrees of automata transformations and their monadic theories.
Attempts at axiomatic description of conditional independence
Attribute-oriented defuzzification of fuzzy database tuples with categorical entries
Automata accepting primitive words.
Automata, algebraicity and distribution of sequences of powers
Let be a finite field of characteristic . Let be the field of formal Laurent series in with coefficients in . That is,with and . We discuss the distribution of for , wheredenotes the nonnegative part of . This is a little different from the real number case where the fractional part that excludes constant term (digit of order 0) is considered. We give an alternative proof of a result by De Mathan obtaining the generic distribution for with for some . This distribution is...
Automata and numeration systems.
Automata and the arithmetic of formal power series
Automata, Borel functions and real numbers in Pisot base
This note is about functions ƒ : Aω → Bω whose graph is recognized by a Büchi finite automaton on the product alphabet A x B. These functions are Baire class 2 in the Baire hierarchy of Borel functions and it is decidable whether such function are continuous or not. In 1920 W. Sierpinski showed that a function is Baire class 1 if and only if both the overgraph and the undergraph of f are Fσ. We show that such characterization is also true for functions on infinite words if we replace the real...