default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMartin Beaudry
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2014
[j14]Martin Beaudry, Danny Dubé, Maxime Dubé, Mario Latendresse, Pascal Tesson:
Conservative groupoids recognize only regular languages. Inf. Comput. 239: 13-28 (2014)- 2011
- [j13]Martin Beaudry, Markus Holzer
:
On the size of inverse semigroups given by generators. Theor. Comput. Sci. 412(8-10): 765-772 (2011) - 2007
- [j12]Martin Beaudry, Markus Holzer:
The Complexity of Tensor Circuit Evaluation. Comput. Complex. 16(1): 60-111 (2007) - 2006
- [j11]Andris Ambainis, Martin Beaudry, Marats Golovkins, Arnolds Kikusts, Mark Mercer, Denis Thérien:
Algebraic Results on Quantum Automata. Theory Comput. Syst. 39(1): 165-188 (2006) - 2005
- [j10]Martin Beaudry, José M. Fernandez, Markus Holzer:
A common algebraic description for probabilistic and quantum computations, . Theor. Comput. Sci. 345(2-3): 206-234 (2005) - 2003
- [j9]Martin Beaudry, Markus Holzer, Gundula Niemann, Friedrich Otto:
McNaughton families of languages. Theor. Comput. Sci. 290(3): 1581-1628 (2003) - 1998
- [j8]Martin Beaudry:
Finite idempotent groupoids and regular languages. RAIRO Theor. Informatics Appl. 32(4-6): 127-140 (1998) - [j7]Martin Beaudry:
Languages Recognized by Finite Aperiodic Groupoids. Theor. Comput. Sci. 209(1-2): 299-317 (1998) - 1997
- [j6]Martin Beaudry, Pierre McKenzie, Pierre Péladeau, Denis Thérien:
Finite Moniods: From Word to Circuit Evaluation. SIAM J. Comput. 26(1): 138-152 (1997) - 1995
- [j5]Martin Beaudry, Pierre McKenzie:
Circuits, Matrices, and Nonassociative Computation. J. Comput. Syst. Sci. 50(3): 441-455 (1995) - 1994
- [j4]Martin Beaudry:
Membership Testing in Threshold One Transformation Monoids. Inf. Comput. 113(1): 1-25 (1994) - 1992
- [j3]Martin Beaudry, Pierre McKenzie, Denis Thérien:
The Membership Problem in Aperiodic Transformation Monoids. J. ACM 39(3): 599-616 (1992) - 1989
- [j2]Martin Beaudry:
Characterization of Idempotent Transformation Monoids. Inf. Process. Lett. 31(3): 163-166 (1989) - 1988
- [j1]Martin Beaudry:
Membership Testing in Commutative Transformation Semigroups. Inf. Comput. 79(1): 84-93 (1988)
Conference and Workshop Papers
- 2009
- [c12]Martin Beaudry, François Lemieux:
Faithful Loops for Aperiodic E-Ordered Monoids. ICALP (2) 2009: 55-66 - 2005
- [c11]Martin Beaudry, François Lemieux, Denis Thérien:
Groupoids That Recognize Only Regular Languages. ICALP 2005: 421-433 - 2004
- [c10]Martin Beaudry, José M. Fernandez, Markus Holzer:
A Common Algebraic Description for Probabilistic and Quantum Computations (Extended Abstract). MFCS 2004: 851-862 - [c9]Andris Ambainis, Martin Beaudry, Marats Golovkins, Arnolds Kikusts, Mark Mercer, Denis Thérien:
Algebraic Results on Quantum Automata. STACS 2004: 93-104 - 2001
- [c8]Martin Beaudry, Markus Holzer, Gundula Niemann, Friedrich Otto:
On the Relationship between the McNaughton Families of Languages and the Chomsky Hierarchy. Developments in Language Theory 2001: 340-348 - [c7]Martin Beaudry, Markus Holzer:
The Complexity of Tensor Circuit Evaluation. MFCS 2001: 173-185 - [c6]Martin Beaudry, François Lemieux, Denis Thérien:
Star-Free Open Languages and Aperiodic Loops. STACS 2001: 87-98 - 1997
- [c5]Martin Beaudry, François Lemieux, Denis Thérien:
Finite Loops Recognize Exactly the Regular Open Languages. ICALP 1997: 110-120 - 1996
- [c4]Martin Beaudry:
Languages Recognized by Finite Aperiodic Groupoids. STACS 1996: 113-124 - 1992
- [c3]Martin Beaudry, Pierre McKenzie:
Cicuits, Matrices, and Nonassociative Computation. SCT 1992: 94-106 - 1989
- [c2]Martin Beaudry, Pierre McKenzie, Denis Thérien:
Testing Membership: Beyond Permutation Groups (Extended Abstract). STACS 1989: 388-399 - 1987
- [c1]Martin Beaudry:
Testing Membership in Commutative Transformation Semigroups. ICALP 1987: 542-549
Informal and Other Publications
- 2018
- [i1]Martin Beaudry:
Proving that a Tree Language is not First-Order Definable. CoRR abs/1812.01674 (2018)
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:47 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:
