convert regular expression to finite automata | TOC | Lec-42 | Bhanu Priya

conversion of regular expression to finite automata in English

[nikhilgarg]

Bhanu please read the comment and please reply back on to them as already mentioned in the previous comment there is a mistake in NFA to DFA conversion.

[MLbyDB]

there is mistake in the equivalent dfa i.e., [q1, q2] on 1 gives [q3]

[labbaikgr]

You are saying that every Nfa is also called FA but its wrong " Every DFA Is also called NDFA"

[rohitpatil]

Your teaching style is very osm mam
❣️

[thakkardivya]

For each of the following regular expressions, draw an FA recognizing the corresponding
language.
a) (0 + 1)*0
b) (11 + 10)*
c) (0 + 1)*(1 + 00)(0 + 1)*
d) (111 + 100)*0
e) 0 + 10* + 01*0
Plz answer find

[saitejapenchala]

Thanks for the best content of regular expression ...

[amamkumarverma]

When we should use subset method and when direct 🙏

[sadhuakhil]

In DFA state q1q2 having mistake its not qf its q3

[GarimaChaurasia-ty]

What happened if the divide symbol is there in the place of addition

[pubgshakes]

Thanks for ur helping sem exam bittu adichitan

[vijaybhopalwani]

in the end their is mistake to convert to nfa to dfa

[theuniverse]

It is wrong conversion from nfa to dfa

[VNediter]

I did not understand 😭 mom's clearly because have not clarity this R.E simplify solution

[suvamjha]

At least you should explain why are you splitting the states, it's like you have written down the solution to the problem from somewhere and just reading it.not helpful

[K.K]

You have just read it out from notes it is not proper explanation.

[Reelswith_manjeet]

you are very poor in regular expression, firstly study deeply and improve teaching quality.

[ZulfiqarAli-ndwm]

Hindi may smja dain to kuch smj ajain gey 😮😢

[avinashavi]

i didn't understand time bokkka

[StorysbyMaara]

Totally wrong, , nuvvu mundhu sarigga pre avvu