Testing Membership in Commutative Transformation Semigroups. - Martin Beaudry (ICALP, 1987)

Membership Testing in Commutative Transformation Semigroups - Martin Beaudry (Inf. Comput., 1988)

Testing Membership: Beyond Permutation Groups (Extended Abstract). - Martin Beaudry; Pierre McKenzie; Denis Thérien (STACS, 1989)

Characterization of Idempotent Transformation Monoids. - Martin Beaudry (Inf. Process. Lett., 1989)

Cicuits, Matrices, and Nonassociative Computation. - Martin Beaudry; Pierre McKenzie (SCT, 1992)

The Membership Problem in Aperiodic Transformation Monoids. - Martin Beaudry; Pierre McKenzie; Denis Thérien (J. ACM, 1992)

Membership Testing in Threshold One Transformation Monoids - Martin Beaudry (Inf. Comput., 1994)

Circuits, Matrices, and Nonassociative Computation. - Martin Beaudry; Pierre McKenzie (J. Comput. Syst. Sci., 1995)

Finite Loops Recognize Exactly the Regular Open Languages. - Martin Beaudry; François Lemieux; Denis Thérien (ICALP, 1997)

Finite Moniods: From Word to Circuit Evaluation. - Martin Beaudry; Pierre McKenzie; Pierre Péladeau; Denis Thérien (SIAM J. Comput., 1997)

Finite idempotent groupoids and regular languages. - Martin Beaudry (RAIRO Theor. Informatics Appl., 1998)

Languages Recognized by Finite Aperiodic Groupoids. - Martin Beaudry (Theor. Comput. Sci., 1998)

On the Relationship between the McNaughton Families of Languages and the Chomsky Hierarchy. - Martin Beaudry; Markus Holzer 001; Gundula Niemann; Friedrich Otto (Developments in Language Theory, 2001)

Star-Free Open Languages and Aperiodic Loops. - Martin Beaudry; François Lemieux; Denis Thérien (STACS, 2001)

McNaughton families of languages. - Martin Beaudry; Markus Holzer 001; Gundula Niemann; Friedrich Otto (Theor. Comput. Sci., 2003)

A Common Algebraic Description for Probabilistic and Quantum Computations (Extended Abstract). - Martin Beaudry; José M. Fernandez 001; Markus Holzer 001 (MFCS, 2004)

Groupoids That Recognize Only Regular Languages. - Martin Beaudry; François Lemieux; Denis Thérien (ICALP, 2005)

A common algebraic description for probabilistic and quantum computations, . - Martin Beaudry; José M. Fernandez 001; Markus Holzer 001 (Theor. Comput. Sci., 2005)

Algebraic Results on Quantum Automata. - Andris Ambainis; Martin Beaudry; Marats Golovkins; Arnolds Kikusts; Mark Mercer; Denis Thérien (Theory Comput. Syst., 2006)

The Complexity of Tensor Circuit Evaluation. - Martin Beaudry; Markus Holzer 001 (Comput. Complex., 2007)

Faithful Loops for Aperiodic E-Ordered Monoids. - Martin Beaudry; François Lemieux (ICALP (2), 2009)

On the size of inverse semigroups given by generators. - Martin Beaudry; Markus Holzer 001 (Theor. Comput. Sci., 2011)

Conservative groupoids recognize only regular languages. - Martin Beaudry; Danny Dubé; Maxime Dubé; Mario Latendresse; Pascal Tesson (Inf. Comput., 2014)

Proving that a Tree Language is not First-Order Definable. - Martin Beaudry (CoRR, 2018)