default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFranck Guingne
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2012
[j7]Jean-Marc Champarnaud, Jean-Philippe Dubernard, Franck Guingne, Hadrien Jeanne:
Geometrical regular languages and linear Diophantine equations: The strongly connected case. Theor. Comput. Sci. 449: 54-63 (2012)- 2011
- [j6]Jean-Marc Champarnaud, Jacques Farré, Franck Guingne:
Reduction Techniques for Acyclic Cover Transducers. Fundam. Informaticae 111(4): 357-371 (2011) - [c8]Jean-Marc Champarnaud, Jean-Philippe Dubernard, Franck Guingne, Hadrien Jeanne:
Geometrical Regular Languages and Linear Diophantine Equations. DCFS 2011: 107-120
2000 – 2009
- 2008
- [j5]Jean-Marc Champarnaud, Franck Guingne, André Kempe, Florent Nicart
:
Algorithms for the Join and Auto-Intersection of Multi-Tape Weighted Finite-State Machines. Int. J. Found. Comput. Sci. 19(2): 453-476 (2008) - 2007
- [c7]Jean-Marc Champarnaud, Franck Guingne, Jacques Farré:
Reducing Acyclic Cover Transducers. CIAA 2007: 38-50 - 2005
- [j4]Jean-Marc Champarnaud, Franck Guingne, Georges Hansel:
Cover transducers for functions with finite domain. Int. J. Found. Comput. Sci. 16(5): 851-865 (2005) - [j3]Jean-Marc Champarnaud, Franck Guingne, Georges Hansel:
Similarity relations and cover automata. RAIRO Theor. Informatics Appl. 39(1): 115-123 (2005) - [c6]André Kempe, Jean-Marc Champarnaud, Franck Guingne, Florent Nicart:
WFSM Auto-intersection and Join Algorithms. FSMNLP 2005: 120-131 - [c5]André Kempe, Jean-Marc Champarnaud, Jason Eisner, Franck Guingne, Florent Nicart:
A Class of Rational n-WFSM Auto-intersections. CIAA 2005: 188-198 - 2004
- [j2]Franck Guingne, Florent Nicart, André Kempe:
Acyclic networks maximizing the printing complexity. Theor. Comput. Sci. 328(1-2): 39-51 (2004) - [c4]Jean-Marc Champarnaud, Franck Guingne, Georges Hansel:
Reducing Cover Subsequential Transducers. DCFS 2004: 131-144 - [i1]André Kempe, Franck Guingne, Florent Nicart:
Algorithms for weighted multi-tape automata. CoRR cs.CL/0406003 (2004) - 2003
- [j1]Franck Guingne, Florent Nicart, Jean-Marc Champarnaud, Lauri Karttunen, Tamás Gaál, André Kempe:
Virtual Operations On Virtual Networks: The Priority Union . Int. J. Found. Comput. Sci. 14(6): 1055-1071 (2003) - [c3]André Kempe, Christof Baeijs, Tamás Gaál, Franck Guingne, Florent Nicart:
WFSC - A New Weighted Finite State Compiler. CIAA 2003: 108-119 - [c2]Franck Guingne, André Kempe, Florent Nicart:
Running Time Complexity of Printing an Acyclic Automaton. CIAA 2003: 131-140 - 2002
- [c1]Franck Guingne, Florent Nicart:
Finite State Lazy Operations in NLP. CIAA 2002: 138-147
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-10-07 21:19 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:
