2.26 DFA Designing - No. of a=n(mod m) && No. of b=p(mod r) | Theory of Computation

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

➡ Do not miss our Bestseller Courses:

➡ Contact Us:
📞Call on: +91-8000121313

➡ Our One Shot Semester Exam Videos: 👇

➡ Free Subject-Wise Complete PlayList: 👇
#knowledgegate #GATE #sanchitjain

*********************************************************

Рекомендации по теме

Комментарии

For complete Theory of Computation, check out this video:

KNOWLEDGEGATE_kg

@KNOWLEDGEGATE_kg In the first question, we have to design a DFA that accepts A = 0(mod2) || B = 0(mod2) but the Solution you gave has 3 Final states and accepts AAA and BBB and strings such that

yatharthmagraiya

Nice videos sir and ans of last questions is option d

official-exsr

Hello sir your channel is amazing.. i want to ask no of final States in question discussed over a, b, c if and is replaced by or.

python

Starting q0q2 than if 1 a comes it goes on q1q2 which is a final state but according to question MDFA is wrong.

i_chandanpatel

Option D correct hai kya
Plzz tell me

TheUnKnown

Option D is the correct answer to the homework question.

royfamily

what happen if we implement string a on this machine it will odd amchine will accept it

alivlogs

Sir jab hamne cartesian product liya jaise q1q2 to usko naya state Q1 nhi bol sakte hain kya

ayushnautiyal

Sir aap concentration khrab main bhi acha he padhate ho.😅

Nisha_chaudhary

2.26 DFA Designing - No. of a=n(mod m) && No. of b=p(mod r) | Theory of Computation

2.26 DFA Designing - No. of a=n(mod m) && No. of b=p(mod r) | Theory of Computation

Design DFA in which no of a's is multiple of 3 and no of b's is multiple of 2 | TOC | Auto...

2.25 DFA Designing - Nth Symbol from Left/Right End is Always 'x' | Theory Of Computation

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

Lec-12: DFA of all binary strings divisible by 3 | DFA Example 5

Regular Expression | DFA | no two consecutive letters are the same | 076

Design DFA in which number of a's and b's both are even | Na(W) mod 2 = 0 and Nb(W) mod ...

Lec-26: Minimization of DFA in Hindi with example | TOC

Design DFA binary number divisible by 2 | TOC | GATECS | Automata Theory

Design DFA in which number of a in w is divisible by 2 | number of a in w is even | Na(W) mod 2 = 0

Design DFA to accept all Binary Strings which are divisible by 3 ( Three ) || Theory of computation

Theory of Computation DFA Example(26) | Calculation of Number of Strings accepted by DFA | Part-2

11 years later ❤️ @shrads

Non-Deterministic Finite Automata (Solved Example 2)

Lec-17: DFA for Even a and Even b | Even a Odd b | Odd a and Even b | Odd a Odd b | TOC

RE to DFA by direct method(Compiler Design) Example 1

DFA Minimization #tech #technology #dfa #finiteautomata #automata #machinedesign #statediagram

DFA Design | No of 0's in a String | EXACTLY 2 | AT LEAST 2 | AT MOST 2| Automata Theory | TOC

Equivalence of DFA with examples

COMPILER DESIGN: UNIT-2 LEXICAL ANALYZER, lastpos,firstpos,followpos,syntax tree method DFA(PART-4)

DFA Design | 'a' is Multiple of 3 and 'b' is Multiple of 2 | Na(w) mod 3= 0 and ...

✍️minimization of DFA 🎯 | best trick ever‼️ equivalence 0 1 2 3 | Theory of computation | gate | exm...

DFA for the strings having no of a's 2, greater than or equal to 2, less than or equal to 2, , ...

27 Theory Of Computation|Construct a minimal DFA such that Na(W)mod3 greater than equal to Na(W)mod2