Register

How to solve?

Recent questions tagged identify-class-language

1 votes
1 answer
122
Identify the language
L = { w | w $\epsilon$ (a,b)* and #a(w) - #b(w) $\leq$ 10}. Is L regular or a CFL?
L = { w | w $\epsilon$ (a,b)* and #a(w) - #b(w) $\leq$ 10}. Is L regular or a CFL?
User Avatar
1 votes
1 answer
123
Identify the language
L1 = {w | length of w is odd and its middle symbol is 0, w $\epsilon$ (0,1)*} Is it regular, a CFL or a CSL?
L1 = {w | length of w is odd and its middle symbol is 0, w $\epsilon$ (0,1)*}Is it regular, a CFL or a CSL?
User Avatar
6 votes
1 answer
124
TOC :Regular Languages
Which of the following is not a regular language? a) $\{ w ( w_r )^* \mid w \in \{0,1\}^* \}$ b) $\{w^n w^m \mid 0\leq n\leq m, w \in \{0,1\} \}$
Which of the following is not a regular language?a) $\{ w ( w_r )^* \mid w \in \{0,1\}^* \}$b) $\{w^n w^m \mid 0\leq n\leq m, w \in \{0,1\} \}$
User Avatar
1 votes
1 answer
138
Gate Practice
L1 = {a^nb^nC^n | n>=0} L2 = {a^nb^mc^k | k=m+n , n,m>=0} L1.(L2)* = ??
L1 = {a^nb^nC^n | n>=0}L2 = {a^nb^mc^k | k=m+n , n,m>=0}L1.(L2)* = ??
User Avatar
0 votes
0 answers
143
How to identify the type of Grammer
Suppose We are given " set of productions " Then how can we identify the lamguage class ffrom them .? please explain giving examples to each language classes
Suppose We are given " set of productions " Then how can we identify the lamguage class ffrom them .? please explain giving examples to each language classes
User Avatar
2 votes
1 answer
145
necessarily Context free ??
Suppose that L is Context free and R is Regular. $A$) $L – R$ is necessarily Context free $B$) $R – L$ is necessarily Context free Which of the above statement/s is/are true?
Suppose that L is Context free and R is Regular.$A$) $L – R$ is necessarily Context free$B$) $R – L$ is necessarily Context freeWhich of the above statement/s is/ar...
User Avatar
Page: