2 problems

Let $\Sigma$ be an ordered alphabet and let $w\in\Sigma^*$ be $M$-ambiguous. Write $[w]$ for the $M$-class of $w$. A class is trivially $\mathbb{P}$-distinguishable when it is a si…

Let $\Sigma$ be an ordered alphabet. For words $u,v\in\Sigma^*$ and a letter $a\in\Sigma$, a word is $M$-unambiguous if it is not $M$-equivalent to any distinct word, where $M$-equ…