Lecture 10 : regular expression containing substring , not containing substring 00 , 101 automata

how to define regular expression containing substring or regular expression not containing substring 00 , 101 in urdu tutorial
regular expression that does not contain a string
regular expression not containing substring 101
Define a RE for language that contains the substring ba
regular expression containing string in urdu
automata regular expression containing substring
regular expression not containing substring
regular expression containing substring
regular expression containing string
regular expression containing substring 00
dfa does not contain substring 011
the set of all strings containing 1101 as a substring
All strings which do not contain the substring ba
regular expression containing special characters
regular expression containing two words
regular expression not containing substring 101
dfa does not contain substring 101
dfa does not contain substring 110
{w| w does not contain the substring ab}
All strings which do not contain the substring 101
dfa substring
regular expression not containing substring 00
dfa for strings ending with 101
design a dfa which accepts set of all strings that begins with 01 and end with 11.
regex does not contain character
regular expression not containing substring 00
regex contains character
regex does not contain multiple words
regex contains string
regex tester
regex negative lookahead
Programology
Write a regular expression and give the corresponding automata for each of the following sets of binary strings. Use only the basic operations.
1. 0 or 11 or 101
0 | 11 | 101
2. only 0s
0*
3. all binary strings
(0|1)*
4. all binary strings except empty string
(0|1)(0|1)*
5. begins with 1, ends with 1
1 | (0|1)*|1
6. ends with 00
(0|1)*00
7. contains at least three 1s
(0|1)*1(0|1)*1(0|1)*1
8. contains at least three consecutive 1s
(0|1)*111(0|1)*
9. contains the substring 110
(0|1)*110(0|1)*
10.doesn't contain the substring 110
(0|10)*1*
11.contains at least two 0s but not consecutive 0s
(1*011*(0+011*))*
12.has at least 3 characters, and the third character is 0
(0|1)(0|1)0(0|1)*
13.number of 0s is a multiple of 3
1*|(1*01*01*01)*
14.starts and ends with the same character
1(0|1)*1|0(0|1)*0
15.odd length
(0|1)((0|1)(0|1))*
16.starts with 0 and has odd length, or starts with 1 and has even length
0((0|1)(0|1))*|1(0|1)((0|1)(0|1))*
17.length is at least 1 and at most 3
(0|1)|(0|1)(0|1)|(0|1)(0|1)(0|1)
Exercise 2: For each of the following, indicate how many bit strings of length exactly 1000
are matched by the regular expression: 0(0 | 1)*1, 0*101*, (1 | 01)*.
What is the regular expression of a string not containing 101 as a
every string must not contain a substring 'abb'
Set of Binary Strings that do not contain 001 as Substring
Regular Expression contain Substring 100
Regular expression to match string of 0's and 1's without '011
Consider the following non-deterministic finite automaton (NFA) over the alphabet Σ = {0,1}. Give a one-sentence description of the language recognized by the NFA. Write a regular expression for this language. The NFA recognizes all strings that contain two 0's separated by a substring whose length is a multiple of 3.
Design finite state automata and regular expressions for the following languages: LЕ = {w : w does not contain the substring 110}. L2 = {w : w contains an even
The expression +0+1 describes the strings with length zero or one, and the expression (0 + ... All strings not containing the substring 101: 0*(1*000*)*1*0*
By: Ali Hassan Soomro
Facebook: AliiHassanSoomro
Gmail: [e-mail]

[@Programology]

Please Note: (a+b)* = L={^,a,b,aa,ab,ba,bb,aaa,aab,..} matlb kuch bi aa skta hy, kitny bi a aur b aaskty hen

[@adeelawan90]

kindly answer (ab)* = L = ????

[@909shayan]

@@adeelawan90 (ab)* = L ={^,ab,abb,aabb,aaabbb...}

[@ahmeryt8837]

@@909shayan L={^,ab,abab,ababab,.....} you are wrong

[@hassangujjar1866]

@@ahmeryt8837 have u solution of this question?

[@hassangujjar1866]

{^,ab,abab,abab,ab..}...?

[@abdulmajidkhan5351]

Excellent , simply the best way of teaching AUTOMATA , sir your lectures made possible for me to understand AUTOMATA which looked like a HUGE GIANT for me before. THANKS

[@mehwishmehwish7624]

Same.

[@Programology]

Thank you very much, share it with your friends

[@al-haider1113]

Best videos of Automata 👍👍👍👍👍👍👍👍👍👍👍👍👍👍👍

[@Programology]

Thank you :-) Share it with your friends

[@Fatimakhan-jf8hw]

Behtareen Sir.. your videos are awesome.. :)

[@Programology]

Thank you :-)

[@sudais774]

sir g very good teaching method i love you

[@kaneezfatima9010]

Bht bht shukria :-)

[@Programology]

:-) share it with your friends

[@tayyabakhalid9248]

Thankx alot sir.... ! we're waiting intensely for ur new videos.... ur videos are amazing and v helpful for our exams but you are uploading videos too late.... :)

[@Programology]

Thank you :-) Share it with your friends

[@chjibrann]

Solid Brother

[@Programology]

thanks, please share it with your friends on whatsapp group or facebook , for any queries, follow me on instagram id: alihassansoomro__ Gmail: [e-mail]

[@Kamrankhan-xn9ir]

too much helpfull for exam... thanks a lot sir..

[@Programology]

Thank you, share it with your friends

[@SomE_OnE_2_0_2_3]

Sir... ❤

[@wahaj_ch8493]

lov u sir g wda wda lov u ho gya

[@rohansahu500]

awesome video bro

[@Programology]

thank you, share it with your friends

[@madihamukhtar2522]

Shukr Allhamdulillah🙏

[@madihamukhtar2522]

sir lecture 10 me ap adhy lecture me poora lecture 9 hi btaya ha itna wait kia or thora sa lecture 10 ha . Sir kindly jldi ext lecture b kr dyen

[@malikhasnain3722]

Amazing Videos.......

[@Programology]

thank you

[@ComputerGuru-tk2hg]

Explained more better than lecturers

[@FaZeFurious]

behtareen concepts clear

[@Programology]

thanks & welcome, for any query, follow me on instagram id: alihassansoomro__

[@rashiduddin2666]

Dear Sir, Please solve the below expression. Question: Write a regular expression for the following language over the alphabet L = {x, y} such that it accepts all strings in which the letter y is never tripled. This means that no word contains the substring yyy.

[@Programology]

Okay

[@farhadnazir106]

your answer is: x*(yy)*(xy)*

[@zartashiamehreen7881]

u r gr8 sir

[@Programology]

Thank you, share it with your friends

[@zartashiamehreen7881]

@@Programology apky he lectures laity hain sb

[@Programology]

Thank you :-)

[@usama57926]

sir thank u

[@Arslankhan-ml4ez]

Thank uhhhhhhhhhhhhhhhhhhh SooooOoooooOooooooooOoooooo MuCh Sir

[@Programology]

Thank you :-) I will upload next lectures about FA very soon, hope you would share these videos with your friends

[@Arslankhan-ml4ez]

@@Programology Yes Sir Please Upload......FA,TGS,NFA etc Alll

[@imongogoi1896]

please make a video on every language defined by a regular expression is also defined by a finite automaton

[@Programology]

Yes

[@nimrazahid5687]

Develop a regular expression for the following language over the alphabet P = {a, b} such that it accepts all strings in which the letter b is never tripled. This means that noword contains the substring bbb. solve: {a,b,aa,bb,aba,aab,aabb,aaab,abba,aaaa....} sir es question ko me ne esy solve kiya hy .please chek it

[@heemuabbas7114]

sir plz jldi jldi upload kriyay na videos

[@Programology]

Jee bilkul, Ab videos jaldi jaldi upload krun ga, stay updated and share these videos with your friends

[@iqrazaman8108]

Good concepts ❗

[@Programology]

thanks & welcome, for any query, follow me on instagram id: alihassansoomro__ whatsapp: [phone]

[@umer_c0des330]

Second last problem answer should be (1 + 01)* (null + 0).

[@maryamakbar8772]

Does it accept 000

[@maryamakbar8772]

000 is allowed to be accept

[@sudaishkatyara1835]

Yes Second Last video me galat hai.

[@sudaishkatyara1835]

​@@maryamakbar8772noops, 000 also contains the substring 00 so it shouldn't be accepted.

[@kawareness3587]

jazakallah

[@Programology]

Thank you, share it with your friends :-)

[@MuhammadIshaq-mm9qw]

Sir itna achaa prhaty ho ap UBIT me hi ajao ap bht acha automata prhaty ho ❤

[@muqaddas2736]

very well sir g!!!!!!!!

[@Programology]

thanks & welcome, for any query, follow me on instagram id: alihassansoomro__ whatsapp: [phone]

[@muqaddas2736]

@@Programology ok ok :)

[@shairazam3581]

Best 👍

[@Programology]

thanks, please share it with your friends on whatsapp group or facebook , for any queries, follow me on instagram id: alihassansoomro__ facebook id: AliiHassanSoomro

[@alanjoseph1101]

Love cc nipun 😍

[@Programology]

thanks, please share it with your friends on whatsapp group or facebook , for any queries, follow me on instagram id: alihassansoomro__ Gmail: [e-mail]

[@called_bunny]

Thankyou brother!

[@Programology]

thanks & welcome, for any query, follow me on instagram id: alihassansoomro__

[@called_bunny]

@@Programology please do complete the CAAO series.

[@ghinaamin9941]

can you please tell the regular expression for the language starting and ending with b and not having consecutive c's over ∑ = {a,b,c}

[@Programology]

See my material that i have provided my exam preparation, thanks & welcome, for any query, follow me on instagram id: alihassansoomro__ whatsapp: [phone]

[@nimrazahid5687]

. Develop a regular expression for the following language over the alphabet P = {a, b} such that it accepts all strings all words in which a is tripled or b is tripled, but not both. This means each word contains the substring aaa or the substring bbb but not both. solution: {a,b,aa,bb,ab,ba,aaa,aba,abb,bbb,aabb,bbaa,aaaa,aaab} sir please es ka bi correct answer

[@soniaashfaque6093]

Write regular expression a) Set of strings of 0s and 1s whose 5th symbol from left is 1. b) Set of strings of 0s and 1s that have 0 at odd positions (even positions can have 0 or 1). kindly es ka answer bata dy

[@Programology]

ji, thanks & welcome, for any query, follow me on instagram id: alihassansoomro__

[@soniaashfaque6093]

rply

[@muhammadhussain6117]

Add more videos before may

[@Programology]

Yes

[@abubkrmahay8767]

kal paper hai boss aagr dubara dubara practice ee krty rahy to kal paper main b practice ee krain gy

[@Programology]

hahah toh mere bhai yeh theory nahi, practice ky biger uskil hojaey gi apko, isme concepts chahiyen

[@ridabatool_awan]

Sir what will the regular expression for all string not containing the substring 000 over ∑ = {0, 1}

[@zcomisb]

RE=(0+1)* .(000). (0+1)*

[@aftabsaleem2670]

@@zcomisb question dobaraa dekho

[@per_ly_bhai8521]

RE:1*01* + 1*001* +(0+1)*0000(0+1)*

[@EUROSPORTS4TECH]

Gg farri

[@Programology]

thanks, please share it with your friends on whatsapp group or facebook , for any queries, contact me on instagram id: alihassan786__

[@maryamakbar8772]

I think second last waly ka RE yeh ha ((0+(000))*+1*) +(1*(0+(000) *) 1*) because only 00 is not allowed more than 00 are allowed

[@bilalmalik4518]

(ab)^* ya (01)^* is language ki strings ki form kya hogi??

[@EUROSPORTS4TECH]

Gg

[@Programology]

thanks, please share it with your friends on whatsapp group or facebook , for any queries, contact me on instagram id: alihassan786__

[@shouaiqbal1862]

All strings whcih do not contain the subtring III

[@shouaiqbal1862]

my undestanding is 0*+1* 00

[@madihamukhtar2522]

Sir lecture 11??? kr dyen

[@Programology]

Jee

[@mahamaqeel3664]

sir yeh sub string bhi clear kar dein ....thora explain kar dein

[@Programology]

JI

[@FunZone29224]

Is this correct 0+1(power +) + 01*

[@muhammadsohail9953]

There's a confusion, in concatenation = ANDing of two strings, what's the difference b/w "ba" & ab... Both are the same. Plz, could you reply to this?

[@Programology]

for any queries, follow me on instagram id: alihassansoomro__ Gmail: [e-mail]

[@saqibamin9942]

Sir g plllmz next lecture upload kr dn

[@Programology]

I will

[@prathammishra2881]

Sir can we get the more than one regular expression for the same question?

[@Ali-VU]

can u give any example for ur question?

[@umairahmed7091]

please remove the background music.

[@muhammadadeel9560]

Any one can explain me last RE 0*(1*000*)*1*0*

[@mamoonmir3862]

kiss practice maa kaa bacha aj kaa baad kise loo naa parhai fail hoo gaya hoo tere rajah saa automata maa