209 views

Please log in or register to answer this question.

Related questions

229
views
0 answers
0 votes
Naveen Kumar 3 asked Apr 5, 2019
229 views
Define the operation $leftside$ on $L$ by $leftside(L)=$ {$w:ww^R∈L$}Is the family of regular languages closed under this operation?
255
views
0 answers
0 votes
Naveen Kumar 3 asked Apr 5, 2019
255 views
Define an operation $minus5$ on a language $L$ as the set of all strings of $L$ with the fifth symbol from the left removed (strings of length less ... ). Show that the family of regular languages is closed under the $minus5$ operation.
292
views
0 answers
0 votes
Naveen Kumar 3 asked Apr 5, 2019
292 views
Let $G_1$ and $G_2$ be two regular grammars. Show how one can derive regular grammars for the languages(a) $L (G_1) ∪ L (G_2)$.(b) $L (G_1) L (G_2)$.(b) $L (G_1)^*$.
326
views
0 answers
0 votes
Naveen Kumar 3 asked Apr 5, 2019
326 views
The $\textit{shuffle}$ of two languages $L_1$ and $L_2$ ... $shuffle$ operation.