default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBruno Patrou
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i6]Pascal Caron, Jean-Gabriel Luque, Bruno Patrou:
Presentation of monoids generated by a projection and an involution. CoRR abs/2402.00417 (2024)- 2023
- [c5]Pascal Caron, Jean-Gabriel Luque, Bruno Patrou:
Operational State Complexity Revisited: The Contribution of Monsters and Modifiers. DCFS 2023: 1-20 - [c4]Pascal Caron, Alexandre Durand, Bruno Patrou:
The Exact State Complexity for the Composition of Root and Reversal. DLT 2023: 74-85 - 2020
- [j8]Pascal Caron
, Edwin Hamel-De le Court, Jean-Gabriel Luque, Bruno Patrou:
New tools for state complexity. Discret. Math. Theor. Comput. Sci. 22(1) (2020) - [j7]Pascal Caron, Jean-Gabriel Luque, Bruno Patrou:
A Combinatorial Approach for the State Complexity of the Shuffle Product. J. Autom. Lang. Comb. 25(4): 291-320 (2020)
2010 – 2019
- 2019
- [j6]Pascal Caron, Jean-Gabriel Luque, Bruno Patrou:
State complexity of combined operations involving catenation and binary Boolean operations: Beyond the Brzozowski conjectures. Theor. Comput. Sci. 800: 15-30 (2019) - [i5]Pascal Caron, Jean-Gabriel Luque, Bruno Patrou:
A combinatorial approach for the state complexity of the Shuffle product. CoRR abs/1905.08120 (2019) - 2018
- [j5]Pascal Caron, Jean-Gabriel Luque, Bruno Patrou:
State Complexity of Multiple Catenations. Fundam. Informaticae 160(3): 255-279 (2018) - [i4]Pascal Caron, Edwin Hamel-De le Court, Jean-Gabriel Luque, Bruno Patrou:
New tools for state complexity. CoRR abs/1807.00663 (2018) - 2017
- [i3]Pascal Caron, Jean-Gabriel Luque, Bruno Patrou:
State complexity of catenation combined with boolean operations. CoRR abs/1707.03174 (2017) - 2016
- [j4]Pascal Caron, Jean-Gabriel Luque, Ludovic Mignot, Bruno Patrou:
State Complexity of Catenation Combined with a Boolean Operation: A Unified Approach. Int. J. Found. Comput. Sci. 27(6): 675-704 (2016) - [i2]Pascal Caron, Jean-Gabriel Luque, Bruno Patrou:
State complexity of multiple catenation. CoRR abs/1607.04031 (2016) - 2015
- [i1]Pascal Caron, Jean-Gabriel Luque, Ludovic Mignot, Bruno Patrou:
State complexity of catenation combined with a boolean operation: a unified approach. CoRR abs/1505.03474 (2015) - 2011
- [j3]Philippe Andary, Bruno Patrou, Pierre Valarcher:
A Representation Theorem for Primitive Recursive Algorithms. Fundam. Informaticae 107(4): 313-330 (2011)
2000 – 2009
- 2005
- [c3]Philippe Andary, Bruno Patrou, Pierre Valarcher:
About Implementation of Primitive Recursive Algorithms. Abstract State Machines 2005: 77-90
1990 – 1999
- 1997
- [c2]Igor Litovsky, Bruno Patrou:
On a Binary Zigzag Operation. Developments in Language Theory 1997: 273-289 - 1996
- [j2]Sandrine Julia, Igor Litovsky, Bruno Patrou:
On Codes, omega-Codes and omega-Generators. Inf. Process. Lett. 60(1): 1-5 (1996) - [j1]Bertrand Le Saëc, Igor Litovsky, Bruno Patrou:
A More Efficient Notion of Zigzag Stability. RAIRO Theor. Informatics Appl. 30(3): 181-194 (1996) - 1995
- [c1]Bruno Patrou:
Zigzag Codes and Z-Free Hulls. Combinatorics and Computer Science 1995: 263-274
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 22:51 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:
