default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarianne Flouret
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j5]Pascal Caron
, Marianne Flouret, Ludovic Mignot:
(k,l)-Unambiguity and Quasi-Deterministic Structures. J. Autom. Lang. Comb. 24(1): 13-49 (2019)- 2014
- [c11]Pascal Caron, Marianne Flouret, Ludovic Mignot:
(k, l)-Unambiguity and Quasi-Deterministic Structures: An Alternative for the Determinization. LATA 2014: 260-272 - [i3]Pascal Caron, Marianne Flouret, Ludovic Mignot:
(k, l)-Unambiguity and Quasi-Deterministic Structures. CoRR abs/1406.3214 (2014) - 2011
- [j4]Pascal Caron, Marianne Flouret:
From Glushkov WFAs to K-Expressions. Fundam. Informaticae 109(1): 1-25 (2011) - 2010
- [p1]Pascal Caron, Marianne Flouret:
On Glushkov K-graphs. Scientific Applications of Language Methods 2010: 103-132
2000 – 2009
- 2009
- [i2]Pascal Caron, Marianne Flouret:
Algorithms for Glushkov K-graphs. CoRR abs/0907.4296 (2009) - 2006
- [i1]Gérard Duchamp, Marianne Flouret, Éric Laugerotte, Jean-Gabriel Luque:
Direct and dual laws for automata with multiplicities. CoRR abs/math/0607412 (2006) - 2005
- [c10]Gaële Simon, Marianne Flouret:
Implementing Validated Agents Behaviours with Automata Based on Goal Decomposition Trees. AOSE 2005: 124-138 - 2003
- [j3]Pascal Caron, Marianne Flouret:
Glushkov Construction for Series: The Non Commutative Case. Int. J. Comput. Math. 80(4): 457-472 (2003) - [c9]Pascal Caron, Marianne Flouret:
From Glushkov WFAs to Rational Expressions. Developments in Language Theory 2003: 183-193 - [c8]Dominique Fournier, Bruno Mermet, Gaële Simon, Marianne Flouret:
Using the SPACE Intermediate Model to Help to Implement Agents. ISMIS 2003: 221-225 - [c7]Bruno Mermet, Gaële Simon, Dominique Fournier, Marianne Flouret:
SPACE: A Method to Increase Tracability in MAS Development. PROMAS 2003: 201-220 - 2002
- [c6]Gaële Simon, Marianne Flouret, Bruno Mermet:
A Methodology to Solve Optimisation Problems with MAS Application to the Graph Colouring Problem. AIMSA 2002: 162-172 - [c5]Marianne Flouret, Bruno Mermet, Gaële Simon:
Vers une méthodologie de développement de SMA adaptés aux problèmes d'optimisation. JFSMA 2002: 245-248 - [c4]Pascal Caron, Marianne Flouret:
Star Normal Form, Rational Expressions, and Glushkov WFAs Properties. CIAA 2002: 248-254 - 2001
- [j2]Gérard Duchamp, Marianne Flouret, Éric Laugerotte, Jean-Gabriel Luque:
Direct and dual laws for automata with multiplicities. Theor. Comput. Sci. 267(1-2): 105-120 (2001) - 2000
- [c3]Pascal Caron, Marianne Flouret:
Glushkov Construction for Multiplicities. CIAA 2000: 67-79
1990 – 1999
- 1999
- [c2]Philippe Andary, Pascal Caron, Jean-Marc Champarnaud, Gérard Duchamp, Marianne Flouret, Éric Laugerotte:
SEA: A Symbolic Environment for Automata Theory. WIA 1999: 13-26 - 1998
- [c1]Gérard Duchamp, Marianne Flouret, Éric Laugerotte:
Operations over Automata with Multiplicities. Workshop on Implementing Automata 1998: 183-191 - 1997
- [j1]Marianne Flouret, Éric Laugerotte:
Noncommutative Minimization Algorithms. Inf. Process. Lett. 64(3): 123-126 (1997)
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-04-24 23:12 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:
