50 search results - page 1 / 10 » Decidability and Complexity in Automatic Monoids |
70
Voted
DLT
2004
14 years 11 months ago
2004
FCT
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. We present three results on divisibility monoids. These divisibility monoids were introduced in [11] as an algebraic generalization of Mazurkiewicz trace monoids. (1) We ...
101
click to vote
MFCS
2005
Springer
15 years 3 months ago
2005
Springer
This paper investigates the word problem for inverse monoids generated by a set Γ subject to relations of the form e = f, where e and f are both idempotents in the free inverse m...
102
Voted
FCT
2007
Springer
15 years 4 months ago
2007
Springer
We present quantum query complexity bounds for testing algebraic properties. For a set S and a binary operation on S, we consider the decision problem whether S is a semigroup or ...
96
Voted
CADE
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. Classifying finite algebraic structures has been a major motivation behind much research in pure mathematics. Automated techniques have aided in this process, but this ha...