199 search results - page 1 / 40 » On some Algorithmic Problems for Groups and Monoids |
RTA
1993
Springer
13 years 9 months ago
1993
Springer
ITA
2006
13 years 5 months ago
2006
We consider the four families of recognizable, synchronous, deterministic rational and rational subsets of a direct product of free monoids. They form a strict hierarchy and we in...
STACS
2010
Springer
14 years 2 days ago
2010
Springer
In this paper we consider the problem of testing whether two finite groups are isomorphic. Whereas the case where both groups are abelian is well understood and can be solved effi...
COCO
1989
Springer
13 years 9 months ago
1989
Springer
For a monoid G, the iterated multiplication problem is the computation of the product of n elements from G. By re ning known completeness arguments, we show that as G varies over ...
IANDC
2008
13 years 5 months ago
2008
We are interested in the design of automated procedures for analyzing the (in)security of cryptographic protocols in the Dolev-Yao model for a bounded number of sessions when we t...