Automata and the word problem. - John C. Meakin (Formal Properties of Finite Automata and Applications, 1988)

Free Inverse Monoids and Graph immersions. - Stuart W. Margolis; John C. Meakin (Int. J. Algebra Comput., 1993)

PSPACE-Completeness of Certain Algorithmic Problems on the Subgroups of Free Groups. - Jean-Camille Birget; Stuart W. Margolis; John C. Meakin; Pascal Weil (ICALP, 1994)

The Word Problem for Inverse Monoids Presented by One Idempotent Relator. - Jean-Camille Birget; Stuart W. Margolis; John C. Meakin (Theor. Comput. Sci., 1994)

On the Word Problem for Tensor Products and Amalgams of Monoids. - Jean-Camille Birget; Stuart W. Margolis; John C. Meakin (Int. J. Algebra Comput., 1999)

PSPACE-complete problems for subgroups of free groups and inverse finite automata. - Jean-Camille Birget; Stuart W. Margolis; John C. Meakin; Pascal Weil (Theor. Comput. Sci., 2000)

Equations in Free Inverse Monoids. - Timothy Deis; John C. Meakin; Géraud Sénizergues (Int. J. Algebra Comput., 2007)

Inverse monoids and immersions of 2-Complexes. - John C. Meakin; Nóra Szakács (Int. J. Algebra Comput., 2015)

Inverse monoids and immersions of Δ-complexes. - John C. Meakin; Nóra Szakács (Int. J. Algebra Comput., 2021)