Výsledky vyhledávání - "Alain Terlutte"

Autor: Aurélien Lemay, Alain Terlutte, François Denis

Publikováno v: ALT

Residual languages are important and natural components of regular languages and several grammatical inference algorithms naturally rely on this notion. In order to identify a given target language L, classical inference algorithms try to identify wo

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e4cc941be3fde0f3a3e9cedd83ff19e6

Zobrazit plný text záznamu

Iterated relabeling tree transducers

Autor: Alain Terlutte, Zoltán Fülöp

Publikováno v: Theoretical Computer Science. 276:221-244

In this paper we consider the closure UCI(Rel) of the class of relabeling tree transformations, under U=union, C=composition and I=iteration. We give a characterization of UCI(Rel) in terms of a short expression built up from Rel with composition and

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::83489fb5d87d69b333c925619b2409fb
https://doi.org/10.1016/s0304-3975(01)00181-5

Zobrazit plný text záznamu

Closure under union and composition of iterated rational transductions

Autor: Alain Terlutte, David Simplot

Publikováno v: RAIRO - Theoretical Informatics and Applications. 34:183-212

Nous poursuivons notre etude des transductions iterees. Dans cet article, nous etudions la cloture par union et composition de quelques classes de fonctions iterees. Nous considerons les fonctions rationnelles les fonctions sous-sequentielles et les

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::6b9ebc8a7b97123390a8ae822ddedc9f
https://doi.org/10.1051/ita:2000114

Zobrazit plný text záznamu

Iteration of rational transductions

Autor: David Simplot, Alain Terlutte

Publikováno v: RAIRO - Theoretical Informatics and Applications. 34:99-129

The purpose of this paper is to show connections between iterated length-preserving rational transductions and linear space computations. Hence, we study the smallest family of transductions containing length-preserving rational transductions and clo

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::268120e7de416d31d469d6dcee35697e
https://doi.org/10.1051/ita:2000109

Zobrazit plný text záznamu

ON COMPUTATIONAL POWER OF WEIGHTED FINITE AUTOMATA

Autor: Alain Terlutte, Juhani Karhumäki, Denis Derencourt, Michel Latteux

Publikováno v: Fundamenta Informaticae. 25:285-293

Weighted Finite Automata are automata with multiplicities used to compute real functions by reading infinite words. The aim of this paper is to study what kind of functions can be computed by level automata, a particular subclass of WFA. Several resu

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::ee7f4810d8c34894c49efe574d105d6c
https://doi.org/10.3233/fi-1996-253406

Zobrazit plný text záznamu

On continuous functions computed by finite automata

Autor: Alain Terlutte, Juhani Karhumäki, Denis Derencourt, Michel Latteux

Publikováno v: RAIRO - Theoretical Informatics and Applications. 28:387-403

Weighted Finite Automata (WFA) can be used to define functions from [0, 1] into R. We give here a method to construct more and more complex WFA computing continuous functions. We give also an example of a continuous function having no derivative at a

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::d2762119503029b78246a0a06f62a6eb
https://doi.org/10.1051/ita/1994283-403871

Zobrazit plný text záznamu

Combinaisons d'automates et de boules de mots pour la classification de séquences

Autor: Alain Terlutte, Fabien Torre, Frédéric Tantini

Publikováno v: Revue des Sciences et Technologies de l'Information-Série RIA : Revue d'Intelligence Artificielle
Revue des Sciences et Technologies de l'Information-Série RIA : Revue d'Intelligence Artificielle, Lavoisier, 2011, Apprentissage artificiel, 25 (3), pp.411-434. ⟨10.3166/ria.25.411-434⟩
Revue des Sciences et Technologies de l'Information-Série RIA : Revue d'Intelligence Artificielle, 2011, Apprentissage artificiel, 25 (3), pp.411-434. ⟨10.3166/ria.25.411-434⟩

National audience; In this paper, we present a general framework for supervised classification. This framework only needs the definition of a generalisation operator and provides ensemble methods. For sequence classification tasks, we show that gramm

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f2ca1253e55e874c24c5c2efb7239e54
https://hal.inria.fr/hal-00643057/document

Zobrazit plný text záznamu

Sequences Classification by Least General Generalisations

Autor: Alain Terlutte, Frédéric Tantini, Fabien Torre

Publikováno v: Grammatical Inference: Theoretical Results and Applications ISBN: 9783642154874
ICGI

The original publication is available at www.springerlink.com; International audience; In this paper, we present a general framework for supervised classification. This framework provides methods like boosting and only needs the definition of a gener

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4ce25c9422e5b6565011cee72f7ef78b
https://hal.inria.fr/inria-00524707

Zobrazit plný text záznamu

Minimal NFA and biRFSA Languages

Autor: Michel Latteux, Alain Terlutte, Yves Roos

Publikováno v: RAIRO-Theoretical Informatics and Applications (RAIRO: ITA)
RAIRO-Theoretical Informatics and Applications (RAIRO: ITA), 2009, 43 (2), pp.221-237. ⟨10.1051/ita:2008022⟩

International audience; In this paper, we define the notion of biRFSA which is a residual finate state automaton (RFSA) whose the reverse is also an RFSA. The languages recognized by such automata are called biRFSA languages. We prove that the canoni

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4b43d4eb0ebdf392b163d4d60260114d
https://inria.hal.science/inria-00296658

Zobrazit plný text záznamu

Cyclic rational transductions and polynomials of rational functions

Autor: Alain Terlutte

Publikováno v: Theoretical Computer Science. 70(2):261-271

This paper is a contribution to the study of some rational transductions of finite image. We analyze the relationship between polynomially bounded rational transductions, cyclic rational transductions of finite image and polynomials of rational funct

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e3c59848af26b70b3cfab9fe73c4ad40

Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání