Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Alain Terlutte
@article{DBLP:journals/ria/TantiniTT11,
author = {Fr{\'{e}}d{\'{e}}ric Tantini and
Alain Terlutte and
Fabien Torre},
title = {Combinaisons d'automates et de boules de mots pour la classification
de s{\'{e}}quences},
journal = {Rev. d'Intelligence Artif.},
volume = {25},
number = {3},
pages = {411--434},
year = {2011},
url = {https://doi.org/10.3166/ria.25.411-434},
doi = {10.3166/RIA.25.411-434},
timestamp = {Wed, 16 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ria/TantiniTT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icgi/TantiniTT10,
author = {Fr{\'{e}}d{\'{e}}ric Tantini and
Alain Terlutte and
Fabien Torre},
editor = {Jos{\'{e}} M. Sempere and
Pedro Garc{\'{\i}}a},
title = {Sequences Classification by Least General Generalisations},
booktitle = {Grammatical Inference: Theoretical Results and Applications, 10th
International Colloquium, {ICGI} 2010, Valencia, Spain, September
13-16, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6339},
pages = {189--202},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-15488-1\_16},
doi = {10.1007/978-3-642-15488-1\_16},
timestamp = {Wed, 13 Jan 2021 14:02:25 +0100},
biburl = {https://dblp.org/rec/conf/icgi/TantiniTT10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/LatteuxRT09,
author = {Michel Latteux and
Yves Roos and
Alain Terlutte},
title = {Minimal {NFA} and biRFSA Languages},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {43},
number = {2},
pages = {221--237},
year = {2009},
url = {https://doi.org/10.1051/ita:2008022},
doi = {10.1051/ITA:2008022},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/LatteuxRT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LatteuxLRT06,
author = {Michel Latteux and
Aur{\'{e}}lien Lemay and
Yves Roos and
Alain Terlutte},
title = {Identification of biRFSA languages},
journal = {Theor. Comput. Sci.},
volume = {356},
number = {1-2},
pages = {212--223},
year = {2006},
url = {https://doi.org/10.1016/j.tcs.2006.01.029},
doi = {10.1016/J.TCS.2006.01.029},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/LatteuxLRT06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0609015,
author = {Julien Carme and
R{\'{e}}mi Gilleron and
Aur{\'{e}}lien Lemay and
Alain Terlutte and
Marc Tommasi},
title = {Residual Finite Tree Automata},
journal = {CoRR},
volume = {abs/cs/0609015},
year = {2006},
url = {http://arxiv.org/abs/cs/0609015},
eprinttype = {arXiv},
eprint = {cs/0609015},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0609015.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DenisLT04,
author = {Fran{\c{c}}ois Denis and
Aur{\'{e}}lien Lemay and
Alain Terlutte},
title = {Learning regular languages using RFSAs},
journal = {Theor. Comput. Sci.},
volume = {313},
number = {2},
pages = {267--294},
year = {2004},
url = {https://doi.org/10.1016/j.tcs.2003.11.008},
doi = {10.1016/J.TCS.2003.11.008},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DenisLT04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dlt/CarmeGLTT03,
author = {Julien Carme and
R{\'{e}}mi Gilleron and
Aur{\'{e}}lien Lemay and
Alain Terlutte and
Marc Tommasi},
editor = {Zolt{\'{a}}n {\'{E}}sik and
Zolt{\'{a}}n F{\"{u}}l{\"{o}}p},
title = {Residual Finite Tree Automata},
booktitle = {Developments in Language Theory, 7th International Conference, {DLT}
2003, Szeged, Hungary, July 7-11, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2710},
pages = {171--182},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-45007-6\_13},
doi = {10.1007/3-540-45007-6\_13},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/dlt/CarmeGLTT03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/fuin/DenisLT02,
author = {Fran{\c{c}}ois Denis and
Aur{\'{e}}lien Lemay and
Alain Terlutte},
title = {Residual Finite State Automata},
journal = {Fundam. Informaticae},
volume = {51},
number = {4},
pages = {339--368},
year = {2002},
url = {http://content.iospress.com/articles/fundamenta-informaticae/fi51-4-02},
timestamp = {Fri, 18 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/fuin/DenisLT02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FulopT02,
author = {Zolt{\'{a}}n F{\"{u}}l{\"{o}}p and
Alain Terlutte},
title = {Iterated relabeling tree transducers},
journal = {Theor. Comput. Sci.},
volume = {276},
number = {1-2},
pages = {221--244},
year = {2002},
url = {https://doi.org/10.1016/S0304-3975(01)00181-5},
doi = {10.1016/S0304-3975(01)00181-5},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/FulopT02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icgi/DenisLT02,
author = {Fran{\c{c}}ois Denis and
Aur{\'{e}}lien Lemay and
Alain Terlutte},
editor = {Pieter W. Adriaans and
Henning Fernau and
Menno van Zaanen},
title = {Some Classes of Regular Languages Identifiable in the Limit from Positive
Data},
booktitle = {Grammatical Inference: Algorithms and Applications, 6th International
Colloquium: {ICGI} 2002, Amsterdam, The Netherlands, September 23-25,
2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2484},
pages = {63--76},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45790-9\_6},
doi = {10.1007/3-540-45790-9\_6},
timestamp = {Tue, 14 May 2019 10:00:52 +0200},
biburl = {https://dblp.org/rec/conf/icgi/DenisLT02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alt/DenisLT01,
author = {Fran{\c{c}}ois Denis and
Aur{\'{e}}lien Lemay and
Alain Terlutte},
editor = {Naoki Abe and
Roni Khardon and
Thomas Zeugmann},
title = {Learning Regular Languages Using {RFSA}},
booktitle = {Algorithmic Learning Theory, 12th International Conference, {ALT}
2001, Washington, DC, USA, November 25-28, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2225},
pages = {348--363},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-45583-3\_26},
doi = {10.1007/3-540-45583-3\_26},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/alt/DenisLT01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/DenisLT01,
author = {Fran{\c{c}}ois Denis and
Aur{\'{e}}lien Lemay and
Alain Terlutte},
editor = {Afonso Ferreira and
Horst Reichel},
title = {Residual Finite State Automata},
booktitle = {{STACS} 2001, 18th Annual Symposium on Theoretical Aspects of Computer
Science, Dresden, Germany, February 15-17, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2010},
pages = {144--157},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44693-1\_13},
doi = {10.1007/3-540-44693-1\_13},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/stacs/DenisLT01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/TerlutteS00,
author = {Alain Terlutte and
David Simplot},
title = {Iteration of rational transductions},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {34},
number = {2},
pages = {99--130},
year = {2000},
url = {https://doi.org/10.1051/ita:2000109},
doi = {10.1051/ITA:2000109},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/TerlutteS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/SimplotT00,
author = {David Simplot and
Alain Terlutte},
title = {Closure under union and composition of iterated rational transductions},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {34},
number = {3},
pages = {183--212},
year = {2000},
url = {https://doi.org/10.1051/ita:2000114},
doi = {10.1051/ITA:2000114},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/SimplotT00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icgi/DenisLT00,
author = {Fran{\c{c}}ois Denis and
Aur{\'{e}}lien Lemay and
Alain Terlutte},
editor = {Arlindo L. Oliveira},
title = {Learning Regular Languages Using Non Deterministic Finite Automata},
booktitle = {Grammatical Inference: Algorithms and Applications, 5th International
Colloquium, {ICGI} 2000, Lisbon, Portugal, September 11-13, 2000,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1891},
pages = {39--50},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/978-3-540-45257-7\_4},
doi = {10.1007/978-3-540-45257-7\_4},
timestamp = {Tue, 14 May 2019 10:00:52 +0200},
biburl = {https://dblp.org/rec/conf/icgi/DenisLT00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/LatteuxST98,
author = {Michel Latteux and
David Simplot and
Alain Terlutte},
editor = {Lubos Brim and
Jozef Gruska and
Jir{\'{\i}} Zlatuska},
title = {Iterated Length-Preserving Rational Transductions},
booktitle = {Mathematical Foundations of Computer Science 1998, 23rd International
Symposium, MFCS'98, Brno, Czech Republic, August 24-28, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1450},
pages = {286--295},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0055778},
doi = {10.1007/BFB0055778},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/LatteuxST98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/fuin/DerencourtKLT96,
author = {Denis Derencourt and
Juhani Karhum{\"{a}}ki and
Michel Latteux and
Alain Terlutte},
title = {On Computational Power of Weighted Finite Automata},
journal = {Fundam. Informaticae},
volume = {25},
number = {3},
pages = {285--293},
year = {1996},
url = {https://doi.org/10.3233/FI-1996-253406},
doi = {10.3233/FI-1996-253406},
timestamp = {Fri, 18 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/fuin/DerencourtKLT96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/DerencourtKLT94,
author = {Denis Derencourt and
Juhani Karhum{\"{a}}ki and
Michel Latteux and
Alain Terlutte},
title = {On Continuous Functions Computed by Finite Automata},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {28},
number = {3-4},
pages = {387--403},
year = {1994},
url = {https://doi.org/10.1051/ita/1994283-403871},
doi = {10.1051/ITA/1994283-403871},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/DerencourtKLT94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HarjuKLT94,
author = {Tero Harju and
H. C. M. Kleijn and
Michel Latteux and
Alain Terlutte},
title = {Representation of Rational Functions with Prefix and Suffix Codings},
journal = {Theor. Comput. Sci.},
volume = {134},
number = {2},
pages = {403--413},
year = {1994},
url = {https://doi.org/10.1016/0304-3975(94)90245-3},
doi = {10.1016/0304-3975(94)90245-3},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/HarjuKLT94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dlt/DerencourtT93,
author = {Denis Derencourt and
Alain Terlutte},
editor = {Grzegorz Rozenberg and
Arto Salomaa},
title = {Compositions of Codings},
booktitle = {Developments in Language Theory, At the Crossroads of Mathematics,
Computer Science and Biology, Turku, Finland, 12-15 July 1993},
pages = {30--43},
publisher = {World Scientific, Singapore},
year = {1993},
timestamp = {Fri, 26 May 2017 12:54:39 +0200},
biburl = {https://dblp.org/rec/conf/dlt/DerencourtT93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/DerencourtKLT92,
author = {Denis Derencourt and
Juhani Karhum{\"{a}}ki and
Michel Latteux and
Alain Terlutte},
editor = {Ivan M. Havel and
V{\'{a}}clav Koubek},
title = {On Computational Power of Weighted Finite Automata},
booktitle = {Mathematical Foundations of Computer Science 1992, 17th International
Symposium, MFCS'92, Prague, Czechoslovakia, August 24-28, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {629},
pages = {236--245},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-55808-X\_22},
doi = {10.1007/3-540-55808-X\_22},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/DerencourtKLT92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Terlutte90,
author = {Alain Terlutte},
title = {Cyclic Rational Transductions and Polynomials of Rational Functions},
journal = {Theor. Comput. Sci.},
volume = {70},
number = {2},
pages = {261--271},
year = {1990},
url = {https://doi.org/10.1016/0304-3975(90)90126-3},
doi = {10.1016/0304-3975(90)90126-3},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Terlutte90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Terlutte88,
author = {Alain Terlutte},
editor = {Robert Cori and
Martin Wirsing},
title = {Cyclic Rational Transductions and Polynomials of Rational Functions},
booktitle = {{STACS} 88, 5th Annual Symposium on Theoretical Aspects of Computer
Science, Bordeaux, France, February 11-13, 1988, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {294},
pages = {149--158},
publisher = {Springer},
year = {1988},
url = {https://doi.org/10.1007/BFb0035841},
doi = {10.1007/BFB0035841},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Terlutte88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/Terlutte87,
author = {Alain Terlutte},
title = {Sur Les Centres De Dol-Languages},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {21},
number = {2},
pages = {137--145},
year = {1987},
url = {https://doi.org/10.1051/ita/1987210201371},
doi = {10.1051/ITA/1987210201371},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/Terlutte87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
last updated on 2023-09-27 22:45 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:
