Displaying 881 – 900 of 922

Showing per page

Automates calculant la complexité de suites automatiques

Théodore Tapsoba (1994)

Journal de théorie des nombres de Bordeaux

Le point fixe u d’une substitution injective uniforme de module σ sur un alphabet A est examiné du point de vue du nombre P ( u , n ) de ses blocs distincts de longueur n . Lorsque u est minimal et A de cardinal deux, nous construisons un automate pour la suite n P ( u , n + 1 ) - P ( u , n ) .

Automates et algébricités

Jean-Paul Allouche (2005)

Journal de Théorie des Nombres de Bordeaux

Dans quelle mesure la régularité des chiffres d’un nombre réel dans une base entière, celle des quotients partiels du développement en fraction continuée d’un nombre réel, ou celle des coefficients d’une série formelle sont-elles liées à l’algébricité ou à la transcendance de ce réel ou de cette série formelle  ? Nous proposons un survol de résultats récents dans le cas où la régularité évoquée ci-dessus est celle de suites automatiques, substitutives, ou sturmiennes.

Automates et codes zigzag

Marcella Anselmo (1991)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Automates finis

Dominique Perrin, Jacques Sakarovitch (1982)

Publications du Département de mathématiques (Lyon)

Automates finis et ensembles normaux

Christian Mauduit (1986)

Annales de l'institut Fourier

Soit u = ( u n ) n N une suite strictement croissante d’entiers reconnaissable par un automate fini. Nous montrons qu’une condition nécessaire et suffisante pour que l’ensemble normal associé a u soit exactement R Q est que l’un au moins des sommets qui reconnaît la suite u soit précédé dans le graphe de l’automate par un sommet possédant au moins deux circuits fermés distincts. Cette condition peut se traduire quantitativement en disant que la suite u doit être plus “dense” que toute suite exponentielle.

Automatic differentiation and its program realization

Jan Hartman, Ladislav Lukšan, Jan Zítko (2009)

Kybernetika

Automatic differentiation is an effective method for evaluating derivatives of function, which is defined by a formula or a program. Program for evaluating of value of function is by automatic differentiation modified to program, which also evaluates values of derivatives. Computed values are exact up to computer precision and their evaluation is very quick. In this article, we describe a program realization of automatic differentiation. This implementation is prepared in the system UFO, but its...

Automatic differentiation platform : design

Christèle Faure (2002)

ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique

Automatic differentiation (AD) has proven its interest in many fields of applied mathematics, but it is still not widely used. Furthermore, existing numerical methods have been developed under the hypotheses that computing program derivatives is not affordable for real size problems. Exact derivatives have therefore been avoided, or replaced by approximations computed by divided differences. The hypotheses is no longer true due to the maturity of AD added to the quick evolution of machine capacity....

Automatic Differentiation Platform: Design

Christèle Faure (2010)

ESAIM: Mathematical Modelling and Numerical Analysis

Automatic differentiation (AD) has proven its interest in many fields of applied mathematics, but it is still not widely used. Furthermore, existing numerical methods have been developed under the hypotheses that computing program derivatives is not affordable for real size problems. Exact derivatives have therefore been avoided, or replaced by approximations computed by divided differences. The hypotheses is no longer true due to the maturity of AD added to the quick evolution of machine capacity....

Automatic Identification of False Friends in Parallel Corpora: Statistical and Semantic Approach

Nakov, Svetlin (2009)

Serdica Journal of Computing

False friends are pairs of words in two languages that are perceived as similar but have different meanings. We present an improved algorithm for acquiring false friends from sentence-level aligned parallel corpus based on statistical observations of words occurrences and co-occurrences in the parallel sentences. The results are compared with an entirely semantic measure for cross-lingual similarity between words based on using the Web as a corpus through analyzing the words’ local contexts extracted...

Currently displaying 881 – 900 of 922