Martin Beaudry

27 papers A* 3A 4B 2C 1Journal 15Unranked 2
YearRankTypeTitle / Venue / Authors
2018 J jnl
Proving that a Tree Language is not First-Order Definable.
CoRR
Martin Beaudry
2014 J jnl
Conservative groupoids recognize only regular languages.
Inf. Comput.
Martin Beaudry, Danny Dubé, Maxime Dubé, Mario Latendresse, Pascal Tesson
2011 J jnl
On the size of inverse semigroups given by generators.
Theor. Comput. Sci.
Martin Beaudry, Markus Holzer
2009 — conf
Faithful Loops for Aperiodic E-Ordered Monoids.
ICALP (2)
Martin Beaudry, François Lemieux
2007 J jnl
The Complexity of Tensor Circuit Evaluation.
Comput. Complex.
Martin Beaudry, Markus Holzer
2006 J jnl
Algebraic Results on Quantum Automata.
Theory Comput. Syst.
Andris Ambainis, Martin Beaudry, Marats Golovkins, Arnolds Kikusts, Mark Mercer, Denis Thérien
2005 J jnl
A common algebraic description for probabilistic and quantum computations
Theor. Comput. Sci.
Martin Beaudry, José M. Fernandez, Markus Holzer
2005 A* conf
Groupoids That Recognize Only Regular Languages.
ICALP
Martin Beaudry, François Lemieux, Denis Thérien
2004 B conf
A Common Algebraic Description for Probabilistic and Quantum Computations (Extended Abstract).
MFCS
Martin Beaudry, José M. Fernandez, Markus Holzer
2004 A conf
Algebraic Results on Quantum Automata.
STACS
Andris Ambainis, Martin Beaudry, Marats Golovkins, Arnolds Kikusts, Mark Mercer, Denis Thérien
2003 J jnl
McNaughton families of languages.
Theor. Comput. Sci.
Martin Beaudry, Markus Holzer, Gundula Niemann, Friedrich Otto
2001 C conf
On the Relationship between the McNaughton Families of Languages and the Chomsky Hierarchy.
Developments in Language Theory
Martin Beaudry, Markus Holzer, Gundula Niemann, Friedrich Otto
2001 A conf
Star-Free Open Languages and Aperiodic Loops.
STACS
Martin Beaudry, François Lemieux, Denis Thérien
2001 B conf
The Complexity of Tensor Circuit Evaluation.
MFCS
Martin Beaudry, Markus Holzer
1998 J jnl
Finite idempotent groupoids and regular languages.
RAIRO Theor. Informatics Appl.
Martin Beaudry
1998 J jnl
Languages Recognized by Finite Aperiodic Groupoids.
Theor. Comput. Sci.
Martin Beaudry
1997 A* conf
Finite Loops Recognize Exactly the Regular Open Languages.
ICALP
Martin Beaudry, François Lemieux, Denis Thérien
1997 J jnl
Finite Moniods: From Word to Circuit Evaluation.
SIAM J. Comput.
Martin Beaudry, Pierre McKenzie, Pierre Péladeau, Denis Thérien
1996 A conf
Languages Recognized by Finite Aperiodic Groupoids.
STACS
Martin Beaudry
1995 J jnl
Circuits, Matrices, and Nonassociative Computation.
J. Comput. Syst. Sci.
Martin Beaudry, Pierre McKenzie
1994 J jnl
Membership Testing in Threshold One Transformation Monoids
Inf. Comput.
Martin Beaudry
1992 — conf
Cicuits, Matrices, and Nonassociative Computation.
SCT
Martin Beaudry, Pierre McKenzie
1992 J jnl
The Membership Problem in Aperiodic Transformation Monoids.
J. ACM
Martin Beaudry, Pierre McKenzie, Denis Thérien
1989 J jnl
Characterization of Idempotent Transformation Monoids.
Inf. Process. Lett.
Martin Beaudry
1989 A conf
Testing Membership: Beyond Permutation Groups (Extended Abstract).
STACS
Martin Beaudry, Pierre McKenzie, Denis Thérien
1988 J jnl
Membership Testing in Commutative Transformation Semigroups
Inf. Comput.
Martin Beaudry
1987 A* conf
Testing Membership in Commutative Transformation Semigroups.
ICALP
Martin Beaudry