Martin Beaudry

Available identifiers

zbMath Open beaudry.martinMaRDI QIDQ476156

List of research outcomes

Publication	Date of Publication	Type
Testing membership: Beyond permutation groups	2022-08-16	Paper
Finite loops recognize exactly the regular open languages	2018-07-04	Paper
Languages recognized by finite aperiodic groupoids	2017-11-16	Paper
Conservative groupoids recognize only regular languages	2014-11-28	Paper
Commutative subloop-free loops.	2012-07-10	Paper
On the size of inverse semigroups given by generators	2011-02-21	Paper
Unbreakable Loops	2010-09-02	Paper
Faithful Loops for Aperiodic E-Ordered Monoids	2009-07-14	Paper
The complexity of tensor circuit evaluation	2008-02-22	Paper
STACS 2004	2007-10-01	Paper
Algebraic results on quantum automata	2006-10-25	Paper
Automata, Languages and Programming	2006-01-10	Paper
A common algebraic description for probabilistic and quantum computations	2005-12-06	Paper
Mathematical Foundations of Computer Science 2004	2005-08-22	Paper
https://portal.mardi4nfdi.de/entity/Q4737921	2004-08-11	Paper
McNaughton families of languages.	2003-08-17	Paper
https://portal.mardi4nfdi.de/entity/Q4779143	2002-11-25	Paper
https://portal.mardi4nfdi.de/entity/Q2762498	2002-01-09	Paper
Languages recognized by finite aperiodic groupoids	1999-01-12	Paper
Finite Monoids: From Word to Circuit Evaluation	1997-08-03	Paper
Circuits, matrices, and nonassociative computation	1996-04-29	Paper
The membership problem in aperiodic transformation monoids	1995-01-05	Paper
https://portal.mardi4nfdi.de/entity/Q4281558	1994-04-07	Paper
Characterization of idempotent transformation monoids	1989-01-01	Paper
Membership testing in commutative transformation semigroups	1988-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3801066	1987-01-01	Paper

Research outcomes over time

This page was built for person: Martin Beaudry