default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlain Terlutte
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2011
[j13]Frédéric Tantini, Alain Terlutte, Fabien Torre
:
Combinaisons d'automates et de boules de mots pour la classification de séquences. Rev. d'Intelligence Artif. 25(3): 411-434 (2011)- 2009
- [j12]Michel Latteux, Yves Roos, Alain Terlutte:
Minimal NFA and biRFSA Languages. RAIRO Theor. Informatics Appl. 43(2): 221-237 (2009) - 2006
- [j11]Michel Latteux, Aurélien Lemay, Yves Roos, Alain Terlutte:
Identification of biRFSA languages. Theor. Comput. Sci. 356(1-2): 212-223 (2006) - 2004
- [j10]François Denis, Aurélien Lemay, Alain Terlutte:
Learning regular languages using RFSAs. Theor. Comput. Sci. 313(2): 267-294 (2004) - 2002
- [j9]François Denis, Aurélien Lemay, Alain Terlutte:
Residual Finite State Automata. Fundam. Informaticae 51(4): 339-368 (2002) - [j8]Zoltán Fülöp, Alain Terlutte:
Iterated relabeling tree transducers. Theor. Comput. Sci. 276(1-2): 221-244 (2002) - 2000
- [j7]Alain Terlutte, David Simplot:
Iteration of rational transductions. RAIRO Theor. Informatics Appl. 34(2): 99-130 (2000) - [j6]David Simplot, Alain Terlutte:
Closure under union and composition of iterated rational transductions. RAIRO Theor. Informatics Appl. 34(3): 183-212 (2000) - 1996
- [j5]Denis Derencourt, Juhani Karhumäki, Michel Latteux, Alain Terlutte:
On Computational Power of Weighted Finite Automata. Fundam. Informaticae 25(3): 285-293 (1996) - 1994
- [j4]Denis Derencourt, Juhani Karhumäki, Michel Latteux, Alain Terlutte:
On Continuous Functions Computed by Finite Automata. RAIRO Theor. Informatics Appl. 28(3-4): 387-403 (1994) - [j3]Tero Harju, H. C. M. Kleijn, Michel Latteux, Alain Terlutte:
Representation of Rational Functions with Prefix and Suffix Codings. Theor. Comput. Sci. 134(2): 403-413 (1994) - 1990
- [j2]Alain Terlutte:
Cyclic Rational Transductions and Polynomials of Rational Functions. Theor. Comput. Sci. 70(2): 261-271 (1990) - 1987
- [j1]Alain Terlutte:
Sur Les Centres De Dol-Languages. RAIRO Theor. Informatics Appl. 21(2): 137-145 (1987)
Conference and Workshop Papers
- 2010
- [c10]Frédéric Tantini, Alain Terlutte, Fabien Torre:
Sequences Classification by Least General Generalisations. ICGI 2010: 189-202 - 2003
- [c9]Julien Carme, Rémi Gilleron, Aurélien Lemay, Alain Terlutte, Marc Tommasi:
Residual Finite Tree Automata. Developments in Language Theory 2003: 171-182 - 2002
- [c8]François Denis, Aurélien Lemay, Alain Terlutte:
Some Classes of Regular Languages Identifiable in the Limit from Positive Data. ICGI 2002: 63-76 - 2001
- [c7]François Denis, Aurélien Lemay, Alain Terlutte:
Learning Regular Languages Using RFSA. ALT 2001: 348-363 - [c6]François Denis, Aurélien Lemay, Alain Terlutte:
Residual Finite State Automata. STACS 2001: 144-157 - 2000
- [c5]François Denis, Aurélien Lemay, Alain Terlutte:
Learning Regular Languages Using Non Deterministic Finite Automata. ICGI 2000: 39-50 - 1998
- [c4]Michel Latteux, David Simplot, Alain Terlutte:
Iterated Length-Preserving Rational Transductions. MFCS 1998: 286-295 - 1993
- [c3]Denis Derencourt, Alain Terlutte:
Compositions of Codings. Developments in Language Theory 1993: 30-43 - 1992
- [c2]Denis Derencourt, Juhani Karhumäki, Michel Latteux, Alain Terlutte:
On Computational Power of Weighted Finite Automata. MFCS 1992: 236-245 - 1988
- [c1]Alain Terlutte:
Cyclic Rational Transductions and Polynomials of Rational Functions. STACS 1988: 149-158
Informal and Other Publications
- 2006
- [i1]Julien Carme, Rémi Gilleron, Aurélien Lemay, Alain Terlutte, Marc Tommasi:
Residual Finite Tree Automata. CoRR abs/cs/0609015 (2006)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:01 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
