Zobrazeno 1 - 10
of 82
pro vyhledávání: '"TERLUTTE, A."'
Tree automata based algorithms are essential in many fields in computer science such as verification, specification, program analysis. They become also essential for databases with the development of standards such as XML. In this paper, we define ne
Externí odkaz:
http://arxiv.org/abs/cs/0609015
Publikováno v:
In Theoretical Computer Science 2006 356(1):212-223
Publikováno v:
In Theoretical Computer Science 2004 313(2):267-294
Autor:
Terlutte, Sarah
Publikováno v:
Anthropologie sociale et ethnologie. 2017
Among Canadian Native peoples, drug abuse constitute a major health problem. The government's policies don't seem fit with the expectations of Native populations. Indeed, it's essential to identify the various contexts of drug consumption but also th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::3ddb7e358b7eab653e9ffcc334be958b
https://dumas.ccsd.cnrs.fr/dumas-01753131/document
https://dumas.ccsd.cnrs.fr/dumas-01753131/document
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
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
https://doi.org/10.1016/s0304-3975(01)00181-5
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
https://doi.org/10.1051/ita:2000114
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
https://doi.org/10.1051/ita:2000109
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
https://doi.org/10.3233/fi-1996-253406