Obtaining Complete Sets of Reductions and Equations Without Using Special Unification Algorithms. - John Pedersen (European Conference on Computer Algebra (2), 1985)

Morphocompletion for One-Relation Monoids. - John Pedersen (RTA, 1989)

Continuous Transitions of Cellular Automata. - John Pedersen (Complex Syst., 1990)

Decision Problems for Cellular Automata and Their Semigroups. - John Pedersen (MFCS, 1992)

Cellular Automata as Algebraic Systems. - John Pedersen (Complex Syst., 1992)

Sum-Free Sets in Vector Spaces over GF(2). - William Edwin Clark; John Pedersen (J. Comb. Theory A, 1992)

Term Rewriting for the Conjugacy Problem and the Braid Groups. - John Pedersen; Margaret Yoder (J. Symb. Comput., 1994)