Bibliographie
Bibliographie
2002 : Z. Fulop and A. Terlutte.
Iterated Relabeling Tree Transducers.
TCS 276.p 221-244 (2002)
Rapport Technique 1999-13. L.I.F.L., Université de Lille 1, France. Décembre 1999.
2002: F. Denis, A. Lemay and A. Terlutte.Some language classes identifiable in the limit from positive data.
ICGI 2002, Lecture Notes in Artificial Intelligence, 2484, p63-76, 2002.
ICGI2002.ps
Learning Regular Languages Using RFSA
ALT 2001, Lecture Notes in Artificial Intelligence, 2225
Learning Regular Languages Using Non Deterministic Finite Automata
Rapport Technique 2000-7. L.I.F.L., Université de Lille 1,
France.
ICGI 2000, Lecture Notes in Artificial Intelligence, 1891, p39-50,
2000.
ICGI2000.ps.gz
Residual Finite States Automata
Fundamenta Informaticae,2002,4, pages 339-368, vol.51.
RFSA version stacs
version longue
Closure under union and composition of iterated rational transductions.
Theoretical Informatics and Applications. vol 34-3. p 183-212. 2000
l'article
Iteration of rational transductions.
Theoretical Informatics and Applications. vol 34-2. p 99-129. 2000
l'article
Iterated length-preserving rational transductions.
Rapport Technique IT-312. L.I.F.L., Université de Lille 1, France. Mars 1998.
On Computational Power of Weighted Finite Automata.
Fundamenta Informaticae 25(3): 285-293 (1996)
Representation of Rational Functions with Prefix and Suffix Codings.
TCS 134(2): 403-413 (1994)
On continuous functions computed by finite automata.
Informatique Théorique et
Applications 28(3-4): 387-403 (1994).
Developments in Language Theory (G.
Rozenberg and A. Salomaa, eds), World Scientific 134(2): 30-43 (1994)
Cyclic Rational Transductions and Polynomials of Rational Functions.
TCS 70(2): 261-271 (1990)
On the Rational Cone Generated by EDTOL.
Second Conference on Automata, Languages and Programming Systems:
215-219 (1988)
Sur les Centres de DOL Langages.
Informatique Théorique et Applications 21(2): 137-145
(1987).
The Parikh-boundedness of ET0L Languages of Finite Index.
The Book of L.