Martin Beaudry - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 26 from 26

2014

Conservative groupoids recognize only regular languagesMartin Beaudry, Danny Dubé, Maxime Dubé, Mario Latendresse, Pascal Tesson. iandc, 239:13-28, 2014. [doi]

2011

On the size of inverse semigroups given by generatorsMartin Beaudry, Markus Holzer. TCS, 412(8-10):765-772, 2011. [doi]

2009

Faithful Loops for Aperiodic E-Ordered MonoidsMartin Beaudry, FranÃ§ois Lemieux. icalp 2009: 55-66 [doi]

2007

The Complexity of Tensor Circuit EvaluationMartin Beaudry, Markus Holzer. cc, 16(1):60-111, 2007. [doi]

2006

Algebraic Results on Quantum AutomataAndris Ambainis, Martin Beaudry, Marats Golovkins, Arnolds Kikusts, Mark Mercer, Denis Thérien. mst, 39(1):165-188, 2006. [doi]

2005

Groupoids That Recognize Only Regular LanguagesMartin Beaudry, François Lemieux, Denis Thérien. icalp 2005: 421-433 [doi]

A common algebraic description for probabilistic and quantum computations:::, :::Martin Beaudry, José M. Fernandez, Markus Holzer. TCS, 345(2-3):206-234, 2005. [doi]

2004

Algebraic Results on Quantum AutomataAndris Ambainis, Martin Beaudry, Marats Golovkins, Arnolds Kikusts, Mark Mercer, Denis Thérien. STACS 2004: 93-104 [doi]

A Common Algebraic Description for Probabilistic and Quantum Computations (Extended Abstract)Martin Beaudry, José M. Fernandez, Markus Holzer. mfcs 2004: 851-862 [doi]

2003

McNaughton families of languagesMartin Beaudry, Markus Holzer, Gundula Niemann, Friedrich Otto. TCS, 290(3):1581-1628, 2003.

2001

Star-Free Open Languages and Aperiodic LoopsMartin Beaudry, François Lemieux, Denis Thérien. STACS 2001: 87-98 [doi]

The Complexity of Tensor Circuit EvaluationMartin Beaudry, Markus Holzer. mfcs 2001: 173-185 [doi]

On the Relationship between the McNaughton Families of Languages and the Chomsky HierarchyMartin Beaudry, Markus Holzer, Gundula Niemann, Friedrich Otto. dlt 2002: 340-348 [doi]

1998

Languages Recognized by Finite Aperiodic GroupoidsMartin Beaudry. TCS, 209(1-2):299-317, 1998. [doi]

Finite idempotent groupoids and regular languagesMartin Beaudry. ita, 32(4-6):127-140, 1998. [doi]

1997

Finite Loops Recognize Exactly the Regular Open LanguagesMartin Beaudry, François Lemieux, Denis Thérien. icalp 1997: 110-120

Finite Moniods: From Word to Circuit EvaluationMartin Beaudry, Pierre McKenzie, Pierre Péladeau, Denis Thérien. SICOMP, 26(1):138-152, 1997.

1996

Languages Recognized by Finite Aperiodic GroupoidsMartin Beaudry. STACS 1996: 113-124

1995

Circuits, Matrices, and Nonassociative ComputationMartin Beaudry, Pierre McKenzie. jcss, 50(3):441-455, 1995.

1992

The Membership Problem in Aperiodic Transformation MonoidsMartin Beaudry, Pierre McKenzie, Denis Thérien. JACM, 39(3):599-616, 1992. [doi]

Cicuits, Matrices, and Nonassociative ComputationMartin Beaudry, Pierre McKenzie. coco 1992: 94-106

1989

Characterization of idempotent transformation monoidsMartin Beaudry. ipl, 32(3):163-166, 1989. [doi]

Characterization of Idempotent Transformation MonoidsMartin Beaudry. ipl, 31(3):163-166, 1989.

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

1988

Membership Testing in Commutative Transformation SemigroupsMartin Beaudry. iandc, 79(1):84-93, October 1988.

1987

Testing Membership in Commutative Transformation SemigroupsMartin Beaudry. icalp 1987: 542-549

Sign in or sign up to see more results.

runs on WebDSL