Martin Beaudry

According to our database, Martin Beaudry authored at least 24 papers between 1987 and 2018.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2018

Proving that a Tree Language is not First-Order Definable.

Martin Beaudry

CoRR, 2018

2014

Conservative groupoids recognize only regular languages.

Martin Beaudry, Danny Dubé, Maxime Dubé, Mario Latendresse, Pascal Tesson

Inf. Comput., 2014

2011

On the size of inverse semigroups given by generators.

Martin Beaudry, Markus Holzer

Theor. Comput. Sci., 2011

2009

Faithful Loops for Aperiodic E-Ordered Monoids.

Martin Beaudry, François Lemieux

Proceedings of the Automata, Languages and Programming, 36th Internatilonal Colloquium, 2009

2007

The Complexity of Tensor Circuit Evaluation.

Martin Beaudry, Markus Holzer

Comput. Complex., 2007

2006

Algebraic Results on Quantum Automata.

Andris Ambainis, Martin Beaudry, Marats Golovkins, Arnolds Kikusts, Mark Mercer, Denis Thérien

Theory Comput. Syst., 2006

2005

A common algebraic description for probabilistic and quantum computations^,.

Martin Beaudry, José M. Fernandez, Markus Holzer

Theor. Comput. Sci., 2005

Groupoids That Recognize Only Regular Languages.

Martin Beaudry, François Lemieux, Denis Thérien

Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

2004

A Common Algebraic Description for Probabilistic and Quantum Computations (Extended Abstract).

Martin Beaudry, José M. Fernandez, Markus Holzer

Proceedings of the Mathematical Foundations of Computer Science 2004, 2004

2003

McNaughton families of languages.

Martin Beaudry, Markus Holzer, Gundula Niemann, Friedrich Otto

Theor. Comput. Sci., 2003

2001

Star-Free Open Languages and Aperiodic Loops.

Martin Beaudry, François Lemieux, Denis Thérien

Proceedings of the STACS 2001, 2001

On the Relationship between the McNaughton Families of Languages and the Chomsky Hierarchy.

Martin Beaudry, Markus Holzer, Gundula Niemann, Friedrich Otto

Proceedings of the Developments in Language Theory, 5th International Conference, 2001

1998

Languages Recognized by Finite Aperiodic Groupoids.

Martin Beaudry

Theor. Comput. Sci., 1998

Finite idempotent groupoids and regular languages.

Martin Beaudry

RAIRO Theor. Informatics Appl., 1998

1997

Finite Moniods: From Word to Circuit Evaluation.

Martin Beaudry, Pierre McKenzie, Pierre Péladeau, Denis Thérien

SIAM J. Comput., 1997

Finite Loops Recognize Exactly the Regular Open Languages.

Martin Beaudry, François Lemieux, Denis Thérien

Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997

1995

Circuits, Matrices, and Nonassociative Computation.

Martin Beaudry, Pierre McKenzie

J. Comput. Syst. Sci., 1995

1994

Membership Testing in Threshold One Transformation Monoids

Martin Beaudry

Inf. Comput., August, 1994

1992

The Membership Problem in Aperiodic Transformation Monoids.

Martin Beaudry, Pierre McKenzie, Denis Thérien

J. ACM, 1992

Cicuits, Matrices, and Nonassociative Computation.

Martin Beaudry, Pierre McKenzie

Proceedings of the Seventh Annual Structure in Complexity Theory Conference, 1992

1989

Characterization of Idempotent Transformation Monoids.

Martin Beaudry

Inf. Process. Lett., 1989

Testing Membership: Beyond Permutation Groups (Extended Abstract).

Martin Beaudry, Pierre McKenzie, Denis Thérien

Proceedings of the STACS 89, 1989

1988

Membership Testing in Commutative Transformation Semigroups

Martin Beaudry

Inf. Comput., October, 1988

1987

Testing Membership in Commutative Transformation Semigroups.

Martin Beaudry

Proceedings of the Automata, Languages and Programming, 14th International Colloquium, 1987