Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by Crossref.
Benson, Clark T.
and
Mendelsohn, N.S.
1966.
A calculus for a certain class of word problems in groups.
Journal of Combinatorial Theory,
Vol. 1,
Issue. 2,
p.
202.
Kölbel, H.
and
Kurzendörfer, P.
1969.
Angewandte Chemie.
Vol. 12/2,
Issue. ,
p.
252.
LEECH, JOHN
1970.
Computational Problems in Abstract Algebra.
p.
21.
MENDELSOHN, N.S.
1970.
Computational Problems in Abstract Algebra.
p.
43.
McLain, D. H.
1977.
An algorithm for determining defining relations of a subgroup.
Glasgow Mathematical Journal,
Vol. 18,
Issue. 1,
p.
51.
Jura, Andrzej
1978.
Coset Enumeration in a Finitely Presented Semigroup.
Canadian Mathematical Bulletin,
Vol. 21,
Issue. 1,
p.
37.
McNaughton, Robert
1998.
The finiteness of finitely presented monoids.
Theoretical Computer Science,
Vol. 204,
Issue. 1-2,
p.
169.
Cuypers, Hans
Soicher, Leonard H.
and
Sterk, Hans
1999.
Some Tapas of Computer Algebra.
Vol. 4,
Issue. ,
p.
184.
PIGGOTT, ADAM
2007.
THE MANIFESTATION OF GROUP ENDS IN THE TODD–COXETER COSET ENUMERATION PROCEDURE.
International Journal of Algebra and Computation,
Vol. 17,
Issue. 01,
p.
203.