Approximating the Minimum Weight Steiner Triangulation.
Approximating the Volume of Convex Bodies.
Approximation de séries formelles par des séries rationnelles
Arbology: Trees and pushdown automata
We present a unified and systematic approach to basic principles of Arbology, a new algorithmic discipline focusing on algorithms on trees. Stringology, a highly developed algorithmic discipline in the area of string processing, can use finite automata as its basic model of computation. For various kinds of linear notations of ranked and unranked ordered trees it holds that subtrees of a tree in a linear notation are substrings of the tree in the linear notation. Arbology uses pushdown automata...
Arbres infinis et systèmes d'équations
Are linear algorithms always good for linear problems?
Arithmetic coding of weighted finite automata
Arithmetic properties of automata: regular sequences.
Arithmetische Prädikate über einem Bereich endlicher Automaten.
Arrangements of Segments that Share Endpoints: Single Face Results.
Associative closure and periodicity of -words
Asymptotic analysis of a class of functional equations and applications
Flajolet and Richmond have invented a method to solve a large class of divide-and-conquer recursions. The essential part of it is the asymptotic analysis of a certain generating function for by means of the Mellin transform. In this paper this type of analysis is performed for a reasonably large class of generating functions fulfilling a functional equation with polynomial coefficients. As an application, the average life time of a party of people is computed, where each person advances one...
Asymptotic behavior of excitable cellular automata.
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 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.
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...
Atoms in the structure of degrees of automata transformations and their monadic theories.