Register

Self Doubt in Regular Language TOC

678 views
3 votes
3 votes
L = {w | no of 0's in w != no of 1's in w and w Ɛ(0+1)*}
What is the Language L?

a. Regular

b. CFL

C. CSL
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

0 votes
0 votes
2 answers
1
rohan.1737 asked Aug 17, 2018
711 views
Self Doubt in checking whether a language is regular or not
Is there any way to check whether a language is regular or not without using Pumping lemma?
Is there any way to check whether a language is regular or not without using Pumping lemma?
User Avatar
0 votes
0 votes
2 answers
2
anupamsworld asked Aug 29, 2022
609 views
Identification of Regular Language | TOC | Practice Question | Unacademy Class
Which of the following is/are Regular? A] $\left \{ XWYW^{R} \space\ | \space\ W,X,Y \in \left \{ a,b \right \}^{+} \right \}$ ... D] None R => Reverse Please describe your answer.
Which of the following is/are Regular?A] $\left \{ XWYW^{R} \space\ | \space\ W,X,Y \in \left \{ a,b \right \}^{+} \right \}$B] $\left \{ WXW^{R}Y \space\ | \space\ W,X,Y...
User Avatar
1 votes
1 votes
0 answers
3
Harish Karnam asked Jan 5, 2018
441 views
TOC Regular Language
Which of the following languages over the alphabet A = {0, 1} is regular? 1. {w ε A* : Ǝu ε A* such that w = uu} 2. {w ε A* : w does not contain any 1’s in even positions, where the leftmost is position 1} 3. {w ε A* : w contains a 1 in every position that is a power of 2}
Which of the following languages over the alphabet A = {0, 1} is regular?1. {w ε A* : Ǝu ε A* such that w = uu}2. {w ε A* : w does not contain any 1’s in even posit...
User Avatar
1 votes
1 votes
1 answer
4
iarnav asked Sep 8, 2017
1,080 views
TOC Regular Language Question
Please ANSWER these?
Please ANSWER these?
User Avatar
Link Copied!