Theory of Computation: Example for DFA (Divisible by 3)

preview_player
Показать описание

Рекомендации по теме
Комментарии
Автор

Crystal clear ✨
Thanks for your valuable teaching mam 😊

rathodpavan
Автор

See if you can understand this:
Divisible by 3
0 % 3 = 0 q0 [000]
1 % 3 = 1 q1 [001]
2 % 3 = 2 q2 [010]
3 % 3 = 0 q0 [011]
4 % 3 = 1 q1 [100]
5 % 3 = 2 q2 [101]
6 % 3 = 0 q0. [110]
So the states are q0, q1 and q2
Draw them.
First, 000. q0- self loop [0] ( q0- final state)
Second, 001 should end with q1.
00 end with q0 and for 1 mark from q0 to q1
Third, 010 should end with q2. 0 end goes to q0. From q0 1 goes to q1 and then mark 0 from q1 to q2.
Similarly do for all
Is it clear for you all?

Sara-iigr
Автор

The way you teach is very simple and easy to understand thanks a lot 😘💕

ankitanapit
Автор

They taught us a very confusing method in clg, but this method was very easy thank u so much mam

pavangowda
Автор

competitive way of doing it is ..

1. prep the table cols - 0 and 1 (since 2 inputs), and rows q0, q1, and q2 (since 3 possible remainders).

2. The number of our interest is of the form 3a + b, with b being the remainder.

3. Adding a zero to right only doubles the original number (note b becomes 2b). Adding a one to the right of a binary number effectively takes it to the next state. You should convince yourself if this is unfamiliar. 10 is 2, 100 is 4, 1000 is 8, and so on.

4. Fill in the table with the focus on the remainder.

ananthakrishnank
Автор

Very good explanation. Please continue. Thank you.

raogaru
Автор

It will accept € too
Why
How it is a binary no.

the_aggregate
Автор

Okay so what’s the difference between 6 % 3 in a normal situation and 6 % 3 here, why is it 0 instead of 2, I don’t follow

captaincappuccino
Автор

Very nicely explained, Ma'am, thanks a lot!!!

gokulnaathbaskar
Автор

Thank you maam, i clearly understand that prblm ❤

RajasreeLaha-wb
Автор

Thankyou mam for this clear explanation

anjalyjayaraj
Автор

Thanks ma'am .. very well EXPLAINED 😊

govindjangid
Автор

Mam could plz make a solution for this question

-> consider a language L*, where L={ab, cd} with Sigma{a, b, c, d}

i) write all words in L* that have six or
less letters/symbols

ii)what is the shortest string in Sigma*
that not in language L*

Grtobehonour
Автор

Aisa lag rha hai jaise khud raatke ayyyi hai

Daftar
Автор

See the repeating pattern
Divisible by 3
A | A B
B | C A
C | B C
(transactions : ABCABC)
Divisible by 4
A | A B
B | C D
C | A B
D | C D
(Transactions: ABCDABCD)
Divisible by 5
A | A B
B | C D
C | E A
D | B C
E | D E

karthikone
Автор

👍nice explanation
Thank you ma'am

kaustubhpatil
Автор

Why do most Indians make that weird sound after they pronounce 't' at the end? Like when she pronounced 'not', she was like 'not ta' 😂... Anyway good explanation

_zerox_X
Автор

Any example with multiplication plzzz...

akhilcb