Martin Beaudry

Publication Activity (10 Years)

Years Active: 1987-2021
Publications (10 Years): 2

Top Topics

Monadic Second Order Logic

Tree Construction

Regular Languages

Top Venues

Publications

Martin Beaudry
Forest languages defined by counting maximal paths. CoRR (2021)
Martin Beaudry
Proving that a Tree Language is not First-Order Definable. CoRR (2018)
Martin Beaudry, Danny Dubé, Maxime Dubé, Mario Latendresse, Pascal Tesson
Conservative groupoids recognize only regular languages. Inf. Comput. 239 (2014)
Martin Beaudry, Markus Holzer
On the size of inverse semigroups given by generators. Theor. Comput. Sci. 412 (8-10) (2011)
Martin Beaudry, François Lemieux
Faithful Loops for Aperiodic E-Ordered Monoids. ICALP (2) (2009)
Martin Beaudry, Markus Holzer
The Complexity of Tensor Circuit Evaluation. Comput. Complex. 16 (1) (2007)
Andris Ambainis, Martin Beaudry, Marats Golovkins, Arnolds Kikusts, Mark Mercer, Denis Thérien
Algebraic Results on Quantum Automata. Theory Comput. Syst. 39 (1) (2006)
Martin Beaudry, François Lemieux, Denis Thérien
Groupoids That Recognize Only Regular Languages. ICALP (2005)
Martin Beaudry, José M. Fernandez, Markus Holzer
. Theor. Comput. Sci. 345 (2-3) (2005)
Martin Beaudry, José M. Fernandez, Markus Holzer
A Common Algebraic Description for Probabilistic and Quantum Computations (Extended Abstract). MFCS (2004)
Andris Ambainis, Martin Beaudry, Marats Golovkins, Arnolds Kikusts, Mark Mercer, Denis Thérien
Algebraic Results on Quantum Automata. STACS (2004)
Martin Beaudry, Markus Holzer, Gundula Niemann, Friedrich Otto
McNaughton families of languages. Theor. Comput. Sci. 290 (3) (2003)
Martin Beaudry, François Lemieux, Denis Thérien
Star-Free Open Languages and Aperiodic Loops. STACS (2001)
Martin Beaudry, Markus Holzer
The Complexity of Tensor Circuit Evaluation. MFCS (2001)
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)
Martin Beaudry
Languages Recognized by Finite Aperiodic Groupoids. Theor. Comput. Sci. 209 (1-2) (1998)
Martin Beaudry
Finite idempotent groupoids and regular languages. RAIRO Theor. Informatics Appl. 32 (4-6) (1998)
Martin Beaudry, François Lemieux, Denis Thérien
Finite Loops Recognize Exactly the Regular Open Languages. ICALP (1997)
Martin Beaudry, Pierre McKenzie, Pierre Péladeau, Denis Thérien
Finite Moniods: From Word to Circuit Evaluation. SIAM J. Comput. 26 (1) (1997)
Martin Beaudry
Languages Recognized by Finite Aperiodic Groupoids. STACS (1996)
Martin Beaudry, Pierre McKenzie
Circuits, Matrices, and Nonassociative Computation. J. Comput. Syst. Sci. 50 (3) (1995)
Martin Beaudry
Membership Testing in Threshold One Transformation Monoids Inf. Comput. 113 (1) (1994)
Martin Beaudry, Pierre McKenzie, Denis Thérien
The Membership Problem in Aperiodic Transformation Monoids. J. ACM 39 (3) (1992)
Martin Beaudry, Pierre McKenzie
Cicuits, Matrices, and Nonassociative Computation. Computational Complexity Conference (1992)
Martin Beaudry, Pierre McKenzie, Denis Thérien
Testing Membership: Beyond Permutation Groups (Extended Abstract). STACS (1989)
Martin Beaudry
Characterization of Idempotent Transformation Monoids. Inf. Process. Lett. 31 (3) (1989)
Martin Beaudry
Membership Testing in Commutative Transformation Semigroups Inf. Comput. 79 (1) (1988)
Martin Beaudry
Testing Membership in Commutative Transformation Semigroups. ICALP (1987)