The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Alain Terlutte: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. François Denis, Aurélien Lemay, Alain Terlutte
    Learning Regular Languages Using RFSA. [Citation Graph (0, 0)][DBLP]
    ALT, 2001, pp:348-363 [Conf]
  2. Denis Derencourt, Alain Terlutte
    Compositions of Codings. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 1993, pp:30-43 [Conf]
  3. Julien Carme, Rémi Gilleron, Aurélien Lemay, Alain Terlutte, Marc Tommasi
    Residual Finite Tree Automata. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2003, pp:171-182 [Conf]
  4. François Denis, Aurélien Lemay, Alain Terlutte
    Learning Regular Languages Using Non Deterministic Finite Automata. [Citation Graph (0, 0)][DBLP]
    ICGI, 2000, pp:39-50 [Conf]
  5. François Denis, Aurélien Lemay, Alain Terlutte
    Some Classes of Regular Languages Identifiable in the Limit from Positive Data. [Citation Graph (0, 0)][DBLP]
    ICGI, 2002, pp:63-76 [Conf]
  6. Denis Derencourt, Juhani Karhumäki, Michel Latteux, Alain Terlutte
    On Computational Power of Weighted Finite Automata. [Citation Graph (0, 0)][DBLP]
    MFCS, 1992, pp:236-245 [Conf]
  7. Michel Latteux, David Simplot, Alain Terlutte
    Iterated Length-Preserving Rational Transductions. [Citation Graph (0, 0)][DBLP]
    MFCS, 1998, pp:286-295 [Conf]
  8. François Denis, Aurélien Lemay, Alain Terlutte
    Residual Finite State Automata. [Citation Graph (0, 0)][DBLP]
    STACS, 2001, pp:144-157 [Conf]
  9. Alain Terlutte
    Cyclic Rational Transductions and Polynomials of Rational Functions. [Citation Graph (0, 0)][DBLP]
    STACS, 1988, pp:149-158 [Conf]
  10. François Denis, Aurélien Lemay, Alain Terlutte
    Residual Finite State Automata. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2002, v:51, n:4, pp:339-368 [Journal]
  11. Denis Derencourt, Juhani Karhumäki, Michel Latteux, Alain Terlutte
    On Computational Power of Weighted Finite Automata. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1996, v:25, n:3, pp:285-293 [Journal]
  12. Denis Derencourt, Juhani Karhumäki, Michel Latteux, Alain Terlutte
    On Continuous Functions Computed by Finite Automata. [Citation Graph (0, 0)][DBLP]
    ITA, 1994, v:28, n:3-4, pp:387-403 [Journal]
  13. David Simplot, Alain Terlutte
    Closure under union and composition of iterated rational transductions. [Citation Graph (0, 0)][DBLP]
    ITA, 2000, v:34, n:3, pp:183-212 [Journal]
  14. Alain Terlutte
    Sur Les Centres De Dol-Languages. [Citation Graph (0, 0)][DBLP]
    ITA, 1987, v:21, n:2, pp:137-145 [Journal]
  15. Alain Terlutte, David Simplot
    Iteration of rational transductions. [Citation Graph (0, 0)][DBLP]
    ITA, 2000, v:34, n:2, pp:99-130 [Journal]
  16. François Denis, Aurélien Lemay, Alain Terlutte
    Learning regular languages using RFSAs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:313, n:2, pp:267-294 [Journal]
  17. Zoltán Fülöp, Alain Terlutte
    Iterated relabeling tree transducers. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:276, n:1-2, pp:221-244 [Journal]
  18. Tero Harju, H. C. M. Kleijn, Michel Latteux, Alain Terlutte
    Representation of Rational Functions with Prefix and Suffix Codings. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:134, n:2, pp:403-413 [Journal]
  19. Michel Latteux, Aurélien Lemay, Yves Roos, Alain Terlutte
    Identification of biRFSA languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:356, n:1-2, pp:212-223 [Journal]
  20. Alain Terlutte
    Cyclic Rational Transductions and Polynomials of Rational Functions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1990, v:70, n:2, pp:261-271 [Journal]
  21. Julien Carme, Rémi Gilleron, Aurélien Lemay, Alain Terlutte, Marc Tommasi
    Residual Finite Tree Automata [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]

  22. Sequences Classification by Least General Generalisations. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002