Regular Languages
- {w | w ∈ {a, b }* }
- {aw | w ∈ {a, b }* }
- {bw | w ∈ {a, b }* }
- {wa | w ∈ {a, b }* }
- {awb | w ∈ {a, b }* }
- {w1abw2 | w1,w2 ∈ {a, b }* }
- { ambn | m,n>0 }
- { ambnck | m,n,k>=0}
- {a2n | n>=0}
- { anbn | n is a positive integer }
- { ww | w ∈ {a, b }* }
- {w | w has an equal number of a’s and b’s}
- {w| w is a palindrome of a’s and b’s}
- {an | n is prime}
- { anbn | n is a positive integer }
- {w | w has an equal number of a’s and b’s}
- { ambn | m < n}
- { ambn | m = 2n}
- { ambnck | if m is even, then n=k}
- {wCwR | w ∈ {a, b }* , C is a special symbol and wR is the reverse of string w}
- {wwR | w ∈ {a, b }* , and wR is the reverse of string w}
- { ambnck | m=n or n=k}
- { ambnck | if m=n, then n=k}
- All regulars
- All DCFLs
- { ww | w ∈ {a, b }*}
- { anbncn | n>=0}
- {an | n is prime}
- { ambnck | m<n<k}
- Let L be a Context-Free Languages, and R be a regular language. Then
- L ∩ R = always CFL and need not be regular
- L ∪ R = always CFL and need not be regular
- L - R = always CFL and need not be regular
- R - L = Always CSL but need not be CFL
- Let D be a DCFL, and R be a regular language. Then
- D ∩ R = always DCFL and need not be regular
- D ∪ R = always DCFL and need not be regular
- D - R = always DCFL and need not be regular
- R - D = Always DCFL but need not be regular
You can follow the detailed champion study plan for GATE CS 2021 from the following link:
Detailed GATE CSE 2021 Champion Study Plan
Candidates can also practice 110+ Mock tests for exams like GATE, NIELIT with BYJU'S Exam Prep Test Series check the following link:
Click Here to Avail GATE CSE Test Series! (100+ Mock Tests)
Get unlimited access to 21+ structured Live Courses all 112+ mock tests with Online Classroom Program for GATE CS & PSU Exams:
Click here to avail Online Classroom Program for Computer Science Engineering
Thanks
#DreamStriveSucceed
Download BYJU'S Exam Prep app for Exam Preparation here
Comments
write a comment