Say that string $x$ is a prefix of a string $y$ if there exists a string $z$ such that $xz = y$, and say that $x$ is aproper prefix of $y$ if in addition $x \not= y$. A language is prefix-free if it doesnt contain a properprefix of any of its members.$$\text{Prefix-FreeREX} = \{(R) \mid R \text{ is a regular expression and $L(R)$ is prefix-free}\}$$I was wondering about how to prove that Prefix-FreeREX is decidable. Also why does a similar approach fail to show that Prefix-FreeCFG is decidable?
Decidability of Is this regular expression prefix-free?
computability;regular expressions