I am looking for concrete examples of cancellative, left reversible semigroups. Left reversible semigroups are also called "Ore semigroups". See this wikipedia page for the definition of a left reversible semigroup. Of course, commutative semigroups are automatically left reversible, and I am looking for non-commutative examples.
Please also mention if these semigroups arise in an interesting setting.
Some examples and further references (and an interesting setting) are given in this paper by Laca:
http://arxiv.org/abs/math/9911135
See section 1.1, pages 2-3.
Here is an example that I found in the book "Algebraic Theory of Semigroups, vol. I" by Clifford and Preston (the exercise on p. 36): The universal semigroup generated by two elements $a,b$ such that $ab = ba^k$. This semigroup can be concretely described as the set of of pairs $(i,j)$, with $i,j$ nonnegative integers, with multitplication $$(i,j)(m,n) = (i+m, k^m + n) .$$
The semigroup $S= \langle a,b\mid a^2=b^2\rangle$ is two-sided reversible.
I suppose that the non-zero elements of a left Ore domain would work --- presumably this is why they are sometimes called Ore semigroups.
To expand: a ring is a left Ore domain if it has no non-trivial zero-divisors and for every non-zero element s of the ring and every other element r of the ring one can find r' in the ring and s' non-zero and in the ring such that rs'=sr'.
Goldie's theorem says every left Noetherian ring without zero-divisors is a left Ore domain so the non-zero elements will form a left-reversible cancellative semigroup. In fact Goldie's theorem says a little more than this but I don't have time to check if the non-zero divisors will always give what you want in any left Goldie ring.
(It is possible I have my left and rights mixed-up here if so just swap them around!).
Handle with care - see comments: Imagine some system with states and transitions between them, e.g. an automaton as in computation theory or a Markov chain as in stochastics, for simplicity assume that you have an assigned initial state. Then you can label the transitions by letters and record your transition history, starting from the initial state, by forming words out of them. This gives you a semigroup. Now declare two words to be equal if they lead you from the initial state to the same state (careful - this is not the way you usually use automata in group theory). Then left reversibility means that you can, from two given states always go on to reach one same state, i.e. any two starts of your program can lead to the same outcome.
A non-deterministic terminating algorithm gives a meaningful example of such a thing. Non-deterministic means that there actually are several ways through your state diagram, terminating means that you always end in the final state.
Another (boring) example: The multiplicative semigroup of a ring - the zero always does the job. This is like an automaton which always has a one-step way from any state to the unique final state.
