(a) Define regular languages. Write regular expression corresponding to the following languages over the alphabet Σ = {a, b} : 10 (i) All strings with even length. (ii) All strings with odd number of a’s and even number of b’s
Given = {a, b}. Write regular expressions for the following cases : (C)number of a’s are even (d) no two a’s come together (e) length of the string is 2 mod 3. Can anybody help me with this?
Your explanation is perfect mam,Thank you 👍
Thanks for acknowledging 😊 Keep learning, keep supporting ✨
Thank you so much for these examples..!
You're most welcome 😊
So brief but exactly explained ... Thank you !!
I'm happy to help 😊
❤thank you!
My pleasure. Keep learning, keep supporting ✨
Super mam,.. thank qu the video is good
Keep learning, keep sharing ✌😊
Great Mam
Keep learning, keep sharing ✌️😊
Well explained,
Thnxx Dear
You're welcome 😊
Nicely explained ☺️ thanks
Keep learning, keep sharing 😊
Very good explanation 👍
Thanks for your feedback 😊
Very good example 👌
Thank you. Keep learning, keep sharing ✌😊
thanks a billion
My pleasure! Keep learning, keep sharing ✌️ 😊
Very well
Keep learning, keep sharing ✌😊
It was brief and easy ma'am thank you :)
You're welcome. Keep learning, keep sharing ✌😊
Mam your explanation is great, thank you mam
Mam please upload mealy machine and more machine concepts.
Sure, I'll try✌ Keep learning, keep supporting 😊
@@CSEconceptswithParinita
Thank you mam🥰🥰
very clear thank you
Keep learning, keep sharing ✌😊
thank you
Keep learning, keep sharing 🙂
thank you so much
My pleasure! Keep learning, keep sharing ✌🙂
Thanks ma'am
My pleasure 😊
Mam what are recursive definitions?
mam plzz explain coversion of regular expression to epsilon NFA mam
really helped dear!
Keep learning, keep supporting ✌😊
thanks
Keep learning, keep sharing ✌😊
Tnq u
Happy to help!
Nice explain mam plzz explain
Not contain example like not contain 000
Okay, I'll try
(a) Define regular languages. Write regular expression corresponding to the following languages over the alphabet Σ = {a, b} : 10
(i) All strings with even length.
(ii) All strings with odd number of a’s and even number of b’s
Language of all strings of 0's and 1's that have
1) odd number of 1's
2) no pairs of consecutive 0's
Ma'am please answer these
1) 0*10*(10*10*)* may be..
I have examples but I have not their solution,,,
I want to take your helps,,,plzzz guide me,,,
You may send me the examples
@@CSEconceptswithParinita plzzz snd your wattsapp contact
write the regular expression for the language where every zero followed by at least 2s one
For the second example, is this also a valid answer? => (0+1)* (00+11) (0+1)*
Yes it is also correct
can you help me if I send you a question relate to regular expression?
Given = {a, b}. Write regular expressions for the following cases :
(C)number of a’s are even
(d) no two a’s come together
(e) length of the string is 2 mod 3.
Can anybody help me with this?
the way
I have a question, can I ask you?
Yes
not contains oo. answer mam
Explanation is so long
Good things take time😂