Martin Beaudry

From MaRDI portal
Person:476156

Available identifiers

zbMath Open beaudry.martinMaRDI QIDQ476156

List of research outcomes





PublicationDate of PublicationType
Testing membership: Beyond permutation groups2022-08-16Paper
Finite loops recognize exactly the regular open languages2018-07-04Paper
Languages recognized by finite aperiodic groupoids2017-11-16Paper
Conservative groupoids recognize only regular languages2014-11-28Paper
Commutative subloop-free loops.2012-07-10Paper
On the size of inverse semigroups given by generators2011-02-21Paper
Unbreakable Loops2010-09-02Paper
Faithful Loops for Aperiodic E-Ordered Monoids2009-07-14Paper
The complexity of tensor circuit evaluation2008-02-22Paper
STACS 20042007-10-01Paper
Algebraic results on quantum automata2006-10-25Paper
Automata, Languages and Programming2006-01-10Paper
A common algebraic description for probabilistic and quantum computations2005-12-06Paper
Mathematical Foundations of Computer Science 20042005-08-22Paper
https://portal.mardi4nfdi.de/entity/Q47379212004-08-11Paper
McNaughton families of languages.2003-08-17Paper
https://portal.mardi4nfdi.de/entity/Q47791432002-11-25Paper
https://portal.mardi4nfdi.de/entity/Q27624982002-01-09Paper
Languages recognized by finite aperiodic groupoids1999-01-12Paper
Finite Monoids: From Word to Circuit Evaluation1997-08-03Paper
Circuits, matrices, and nonassociative computation1996-04-29Paper
The membership problem in aperiodic transformation monoids1995-01-05Paper
https://portal.mardi4nfdi.de/entity/Q42815581994-04-07Paper
Characterization of idempotent transformation monoids1989-01-01Paper
Membership testing in commutative transformation semigroups1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38010661987-01-01Paper

Research outcomes over time

This page was built for person: Martin Beaudry