Register

regular lang

• retagged by
395 views
1 votes
1 votes

let l denote the language denoted by the grammer 
s--> 00T

T-->11S/11

  • l=(0|1)
  • l is regular but not (0|1)
  • l is CFL but not regular 
  • l is not CFL
• retagged by
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

2 votes
2 votes
1 answer
1
iarnav asked Sep 5, 2017
392 views
TOC Doubt about Regular Lang
Let $L⊆Σ^*$ where $Σ=\{a,b\}.$ is above statement True? L = {x∣x has n(a) >= n(b)} is regular?
Let $L⊆Σ^*$ where $Σ=\{a,b\}.$ is above statement True?L = {x∣x has n(a) >= n(b)} is regular?
User Avatar
1 votes
1 votes
1 answer
2
Miki_Patel asked Sep 26, 2016
793 views
Peterlinz- find out if lang is regular or not
L= { uwwRv : u,v,w are from {a,b}+ } is L regular ? L' = { wwRv : u,v,w are from {a,b}+ } is L' regular ?
L= { uwwRv : u,v,w are from {a,b}+ } is L regular ?L' = { wwRv : u,v,w are from {a,b}+ } is L' regular ?
User Avatar
0 votes
0 votes
1 answer
3
mehul vaidya asked Sep 3, 2018
540 views
is intersection of CFL and Regular Lang always context free
To find intersection of this two : If i proceed like this regular ∩ CFG CFG ∩ CFG as regular lang is also CFG but CFG is not closed under intersection hence answer may not be CFG.
To find intersection of this two : If i proceed like thisregular ∩ CFG CFG ∩ CFG as regular lang is also CFGbut CFG is not closed under intersectionhence answer ma...
User Avatar
Link Copied!