CMI2011-B-04b

Question

Let $L \subseteq \{0,1\}^*$ Suppose $L$ is regular and there is a non-deterministic automaton $N$ which recognizes $L$. Define the reverse of the language $L$ to be the language $L^R = \{w \in \{0, 1\}^* \mid \text{ reverse}(w) \in L \}$ - here $reverse(w)$ denotes the string $w$ read in reverse. For example $reverse(0001) = 1000$.

1. Show that the language $L.L^R \triangleq \{x \in \{0, 1\}^* | \exists y,z$ where $x=yz, \: y \in L, \: z \in L^R \}$ is regular. How can you use $N$ to construct an automata for $L.L^R$?

Answer 1

Yes We can form a NFA for L.L^R . So, it is regular

Comments

@Arjun Sir @Praveen sir  plz chk it

---

What is the NFA doing?

---

you have created NFA and you don't know what it is doing  ....Lol