The Post Correspondence Problem and equalisers for certain free group and monoid morphisms

10 Sep 2020 Ciobanu Laura Logan Alan D.

A marked free monoid morphism is a morphism for which the image of each generator starts with a different letter, and immersions are the analogous maps in free groups. We show that the (simultaneous) PCP is decidable for immersions of free groups, and provide an algorithm to compute bases for the sets, called equalisers, on which the immersions take the same values... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • GROUP THEORY
  • DISCRETE MATHEMATICS
  • FORMAL LANGUAGES AND AUTOMATA THEORY
  • LOGIC IN COMPUTER SCIENCE