Let PREFIX-FREE REX = {R| R is a regular expression and L(R) is prefix-free}. Show that PREFIX-FREEREX

Question:

Let PREFIX-FREEREX = {〈R〉| R is a regular expression and L(R) is prefix-free}. Show that PREFIX-FREEREX is decidable. Why does a similar approach fail to show that PREFIX FREECFG is decidable?

Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Related Book For  book-img-for-question
Question Posted: