In one of the works about tree languages I met the following definition:
Let $\mathcal{N}$ be the set of nonnegative integers and let $U$ be the free monoid generated by $\mathcal{N}$ with operation $\cdot$ and identify $0$. Let $a\leq b$ for $a,b\in U$ iff $\exists x\in U\ni a\cdot x=b$, let $a$ and $b$ incomparable iff $a\nleq b$ and $b\nleq a$, and let $a<b$ if $a<b$ and $a\neq b$.
This is exact citation from the paper (from ethical reasons I do not know should I give exact link to it or not).
It seems to me that there are 3 inaccurates in this definition. I just want to be sure that it is not my misunderstanding, but possible misprint in the paper. Could you please confirm my assumption or explain why it is wrong?
It should be not "indetify" but "identity"
The definition of $a\leq b$ implies that $a\neq b$, because if $x$ exists, then $a\cdot x\neq a$?
The definition of the strict inequality $a<b$ seems to me totally confusing. It probably should be: $a<b$ iff $a\leq b$ and $a\neq b$, but according to p.2 it seems to be useless.