Publications
Thèse de doctorat
[T0] F. Guingne,
Contribution à l'algorithmique
des automates pondérés à une, deux ou
plusieurs bandes. Thèse de doctorat de
l'université de Rouen, LIFAR, juin 2005.
[PS]
Revues internationales avec comité de lecture
2005
[R1] J.-M. Champarnaud, F. Guingne and G. Hansel,
Similarity Relations and Cover Automata,
RAIRO-Theoretical Informatics and Applications,
39(1), 115--124 (2005).
[PS]
[R2] J.-M. Champarnaud, F. Guingne and G. Hansel,
Cover Transducers for Functions with Finite Domain,
Intern. J. of Foundations of Comp. Sc., Vol. 16, No. 5 (2005) 851-865.
[PDF]
2004
[R3] T. Gaal, F. Guingne and F. Nicart,
OTHER Extension to Finite State Automata,
Publicationes Mathematicae Debrecen, 525-534 (2004).
[PS]
[R4] F. Guingne, A. Kempe and F. Nicart,
Acyclic Networks Maximizing the Printing Complexity,
Theoret. Comput. Sci., 328(1--2): 39--51 (2004).
[PS]
2003
[R5] F. Guingne, F. Nicart, J.-M. Champarnaud, L. Karttunen, T. Gaal
and A. Kempe,
Virtual Operations on Virtual Networks: the Priority Union,
Intern. J. of Foundations of Comp. Sc., 14--6(2003), 1055--1069.
[PS]
Colloques d'audience internationale avec comité de
programme
2005
[C1] A. Kempe, J.-M. Champarnaud, J. Eisner, F. Guingne and F. Nicart,
A Class of Rational $n$-WFSM Auto-Intersections,
CIAA 2005 (Conference on Implementing and Applications of Automata),
Sophia-Antipolis, France, June 27-29, 2005. Lecture Notes in Computer
Science, J. Farré, I. Litovsky and S. Schmitz eds.,
Springer-Verlag, 3845(2006) : 188--198.
[PS]
[C2] A. Kempe, J.-M. Champarnaud, F. Guingne and F. Nicart,
WFSM Auto-Intersection and Join Algorithms,
FSMNLP Finite State Methods in Natural Language Processing, Helsinki,
Finland, September 1-2, 2005. Lecture Notes in Computer Science 2006,
to appear.
[PS]
2004
[C3] A. Kempe, F. Nicart and F. Guingne,
Three new algorithms for WMTAs,
in WATA'04, Proceedings,
M. Droste and H. Vogler eds., 2004.
[PS]
[C4] J.-M. Champarnaud, F. Guingne and G. Hansel,
Cover K-automata,
in WATA'04, Proceedings,
M. Droste and H. Vogler eds., 2004.
[PS]
[C5] J.-M. Champarnaud, F. Guingne and G. Hansel,
Reducing cover subsequential transducers,
DCFS'2004 Proceedings,
Descriptional Complexity of Formal Systems Workshop,
L. Ilie and D. Wotschke, eds.,
2004, 131--143.
[PS]
2003
[C6] F. Guingne, A. Kempe and F. Nicart,
Running Time Complexity of Printing an Acyclic Automaton,
CIAA 2003,
Springer, Lecture Notes in Computer Science, O. H. Ibarra Z. Dang eds.,
2759(2003): 131--140.
[PS]
[C7] A. Kempe, C. Baeijs, T. Gaal, F. Guingne and F. Nicart,
WFSC, A New Weighted Finite State Compiler,
CIAA 2003,
Springer, Lecture Notes in Computer Science, O. H. Ibarra Z. Dang eds.,
2759(2003): 108--119.
[PS] [PDF]
2002
[C8] F. Guingne and F. Nicart,
Finite State Lazy Operations in NLP,
CIAA 2002,
Springer, Lecture Notes in Computer Science, J.-M. Champarnaud and D.
Maurel eds., 2608(2003): 138--147.
[PS]
Rapports (2004)
[R1] A. Kempe, F. Guingne and F. Nicart,
Algorithms for Weighted Multi-Tape Automata,
XRCE Technical Research Report 2004/031.
[PDF]
Communications Diverses (2002)
[D1] F. Guingne, F. Nicart,
Finite State Lazy Operations in
NLP, EJC2002 Lille.
[PS]
Brevets (2004)
[B1] A. Kempe, F. Guingne and F. Nicart,
Method and Apparatus for Processing Natural Language Using
Multi-Tape Intersection,
Brevet déposé par Xerox au US Patent and
Trademark Office.
[B2] A. Kempe, F. Guingne and F. Nicart,
Method and Apparatus for Processing Natural Language Using
Auto-Intersection,
Brevet déposé par Xerox au US Patent and
Trademark Office.
Soumis
[S1] A. Kempe, J.-M. Champarnaud, J. Eisner, F. Guingne and F. Nicart,
Algorithms for the Join and Auto-Intersection of Multi-Tape
Weighted Finite State Machines,
soumis à Intern. J. of Foundations of Comp. Sc.
[PS]
[S2] J.-M. Champarnaud, F. Guingne and J. Farré,
Reducing acyclic cover transducers,
Accepté à CIAA 2007.
[PS]
