search
Log In
0 votes
152 views
Let $PREFIX-FREE_{REX} = \{\langle R \rangle \mid \text{R is a regular expression and L(R) is prefix-free}\}$. Show that $PREFIX FREE_{REX}$ is decidable. Why does a similar approach fail to show that $PREFIX-FREE_{CFG}$ is decidable?
in Theory of Computation
edited by
152 views

Please log in or register to answer this question.

Related questions

0 votes
0 answers
1
0 votes
0 answers
2
141 views
Say that a variable $A$ in $CFL\: G$ is usable if it appears in some derivation of some string $w \in G$. Given a $CFG\: G$ and a variable $A$, consider the problem of testing whether $A$ is usable. Formulate this problem as a language and show that it is decidable.
asked Oct 17, 2019 in Theory of Computation Lakshman Patel RJIT 141 views
0 votes
0 answers
3
59 views
Let $A$ be a Turing-recognizable language consisting of descriptions of Turing machines, $\{ \langle M_{1}\rangle,\langle M_{2}\rangle,\dots\}$, where every $M_{i}$ is a decider. Prove that some decidable language $D$ is not decided by any decider $M_{i}$ whose description appears in $A$. (Hint: You may find it helpful to consider an enumerator for $A$.)
asked Oct 17, 2019 in Theory of Computation Lakshman Patel RJIT 59 views
0 votes
0 answers
4
...