John C. Meakin

According to our database, John C. Meakin authored at least 9 papers between 1988 and 2021.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2021

Inverse monoids and immersions of Δ-complexes.

John C. Meakin, Nóra Szakács

Int. J. Algebra Comput., 2021

2015

Inverse monoids and immersions of 2-Complexes.

John C. Meakin, Nóra Szakács

Int. J. Algebra Comput., 2015

2007

Equations in Free Inverse Monoids.

Timothy Deis, John C. Meakin, Géraud Sénizergues

Int. J. Algebra Comput., 2007

2000

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

1999

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

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

PSPACE-Completeness of Certain Algorithmic Problems on the Subgroups of Free Groups.

Jean-Camille Birget, Stuart W. Margolis, John C. Meakin, Pascal Weil

Proceedings of the Automata, Languages and Programming, 21st International Colloquium, 1994

1993

Free Inverse Monoids and Graph immersions.

Stuart W. Margolis, John C. Meakin

Int. J. Algebra Comput., 1993

1988

Automata and the word problem.

John C. Meakin

Proceedings of the Formal Properties of Finite Automata and Applications, 1988