Amalgams of inverse semigroups and reversible two-counter machines

Details Amalgams of inverse semigroups and reversible two-counter machines Amalgams of inverse semigroups and reversible two-counter machines

2011-05-10

arxiv.org/abs/1105.1905v1

Mathematics

Group Theory

Scientific paper

We show that the word problem for an amalgam $[S_1,S_2;U,\omega_1,\omega_2]$ of inverse semigroups may be undecidable even if we assume $S_1$ and $S_2$ (and therefore $U$) to have finite $\mathcal{R}$-classes and $\omega_1,\omega_2$ to be computable functions, interrupting a series of positive decidability results on the subject. This is achieved by encoding into an appropriate amalgam of inverse semigroups 2-counter machines with sufficient universality, and relating the nature of certain \sch graphs to sequences of computations in the machine.

Affiliated with

Also associated with

No associations

Rating

Amalgams of inverse semigroups and reversible two-counter machines does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Amalgams of inverse semigroups and reversible two-counter machines, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Amalgams of inverse semigroups and reversible two-counter machines will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-279112