-* finite strings of an alphabet `A`, with `*` being concatenation and `z` being the empty string
-* all functions `X->X` over a set `X`, with `*` being composition and `z` being the identity function over `X`
-* the natural numbers with `*` being plus and `z` being `0` (in particular, this is a **commutative monoid**). If we use the integers, or the naturals mod n, instead of the naturals, then every element will have an inverse and so we have not merely a monoid but a **group**.)
-* if we let `*` be multiplication and `z` be `1`, we get different monoids over the same sets as in the previous item.
+* finite strings of an alphabet `A`, with <code>⋆</code> being concatenation and `z` being the empty string
+* all functions <code>X→X</code> over a set `X`, with <code>⋆</code> being composition and `z` being the identity function over `X`
+* the natural numbers with <code>⋆</code> being plus and `z` being `0` (in particular, this is a **commutative monoid**). If we use the integers, or the naturals mod n, instead of the naturals, then every element will have an inverse and so we have not merely a monoid but a **group**.)
+* if we let <code>⋆</code> be multiplication and `z` be `1`, we get different monoids over the same sets as in the previous item.