Subject - Thoery Of Computation
Topic - 72 Theory Of Computation | Chennai Mathematical Institute (CMI) 2012 Question on Finite Automata
Link:-
https://youtu.be/cviV1I6Z1Fg
Topic - 72 Theory Of Computation | Chennai Mathematical Institute (CMI) 2012 Question on Finite Automata
Link:-
https://youtu.be/cviV1I6Z1Fg
YouTube
74 Theory of Computation | Chennai Mathematical Institute (CMI) 2012 Question on Finite Automata
Welcome to Computer Science And IT Gate Coaching.
In this video I have explained:-
1) Chennai Mathematical Institute (CMI) 2012 Question on Finite Automata
2) How to do Chennai Mathematical Institute (CMI) 2012 Question on Finite Automata
3) What is the…
In this video I have explained:-
1) Chennai Mathematical Institute (CMI) 2012 Question on Finite Automata
2) How to do Chennai Mathematical Institute (CMI) 2012 Question on Finite Automata
3) What is the…
Subject - Theory of Computation
Topic - Theory Of Computation | FA | DFA Construction | Minimal DFA on L= {a^3bwa^3 | w ∈ {a,b}* }
Link:-https://youtu.be/3rMg3ZxY_h8
Topic - Theory Of Computation | FA | DFA Construction | Minimal DFA on L= {a^3bwa^3 | w ∈ {a,b}* }
Link:-https://youtu.be/3rMg3ZxY_h8
YouTube
75 Theory of Computation | FA | DFA Construction | Minimal DFA on L= {a^3bwa^3 | w ∈ {a, b}* }
Welcome to Gate CS Coaching.
In this video I have explained:-
1) Minimal DFA on L= { a^3bwa^3 | w ∈ {a, b}* }
Timetable:-
0:55- Minimal DFA on L= {a^3bwa^3 | w ∈ {a, b}* } , Explained in Detail
-----------------------------------------
Contact Details…
In this video I have explained:-
1) Minimal DFA on L= { a^3bwa^3 | w ∈ {a, b}* }
Timetable:-
0:55- Minimal DFA on L= {a^3bwa^3 | w ∈ {a, b}* } , Explained in Detail
-----------------------------------------
Contact Details…
Subject - Theory of Computation
Topic - Theory Of Computation | Minimal DFA on set of all strings where number of a's and b's are 5 and 7 }
Link:- https://youtu.be/mFpFXGWyIJE
Topic - Theory Of Computation | Minimal DFA on set of all strings where number of a's and b's are 5 and 7 }
Link:- https://youtu.be/mFpFXGWyIJE
YouTube
76 Theory of Computation | Minimal DFA on set of all strings where number of a's and b's are 5 and 7
Welcome to Computer Science And IT Gate Coaching.
In this video I have explained:-
1) Gate Expected Questions on Number of states in Minimal DFA for L=set of all strings of a's and b's with exactly 5 a's and 7 b's
Timetable:-
0:52- Gate Expected Questions:…
In this video I have explained:-
1) Gate Expected Questions on Number of states in Minimal DFA for L=set of all strings of a's and b's with exactly 5 a's and 7 b's
Timetable:-
0:52- Gate Expected Questions:…
Subject - Theory of Computation
Topic - Theory Of Computation | DFA Construction | Minimal DFA on L={a^n | n not equal to 3} L={ a^n | n≠2 and n≠2 ,n≠4}
Link:-
https://youtu.be/UuReZh7LR8w
Topic - Theory Of Computation | DFA Construction | Minimal DFA on L={a^n | n not equal to 3} L={ a^n | n≠2 and n≠2 ,n≠4}
Link:-
https://youtu.be/UuReZh7LR8w
YouTube
77 Theory of Computation | DFA Construction | Minimal DFA on L={ a^n | n≠3 } L={ a^n | n≠2, n≠ 4}
Welcome to Gate CS Coaching.
In this video I have explained:-
Timetable:-
0:50- Construct a Minimal DFA on L={a^ n /n=0 ,n not equal to 3}
2:32- Construct a Minimal DFA on L={a^ n/n, 0 , n not equal to 2, n not equal to 4}
--------------------------…
In this video I have explained:-
Timetable:-
0:50- Construct a Minimal DFA on L={a^ n /n=0 ,n not equal to 3}
2:32- Construct a Minimal DFA on L={a^ n/n, 0 , n not equal to 2, n not equal to 4}
--------------------------…
Subject - Theory of Computation
Topic - Theory Of Computation | Minimization of DFA | Procedure of Minimization of DFA | Minimal DFA
Link:-
https://youtu.be/GtZRoin-d0o
Topic - Theory Of Computation | Minimization of DFA | Procedure of Minimization of DFA | Minimal DFA
Link:-
https://youtu.be/GtZRoin-d0o
YouTube
78 Theory Of Computation | Minimization of DFA | Procedure of Minimization of DFA | Minimal DFA
Welcome to Gate CS Coaching.
In this video I have explained:-
1) What is Minimization of DFA (Deterministic Finite Automata)
2) Summary of Minimization of DFA (Deterministic Finite Automata)
3) Procedure of Minimization of DFA (Deterministic Finite Automata)…
In this video I have explained:-
1) What is Minimization of DFA (Deterministic Finite Automata)
2) Summary of Minimization of DFA (Deterministic Finite Automata)
3) Procedure of Minimization of DFA (Deterministic Finite Automata)…
Subject - Theory of Computation
Topic - 80 Theory of Computation | Minimization of DFA by state partition Table Example 2 | Minimal DFA
Link:-https://youtu.be/NuOxGqdwhys
Topic - 80 Theory of Computation | Minimization of DFA by state partition Table Example 2 | Minimal DFA
Link:-https://youtu.be/NuOxGqdwhys
YouTube
80 Theory of Computation | Minimization of DFA by State Partition Table Example 2 | Minimal DFA
Welcome to Gate CS Coaching.
In this video I have explained:-
1) With Diagram How to Construct a Minimization of DFA
2) By using State - Partition Table , How to Minimize the DFA
Timetable:-
0:52- Diagram of Minimization of DFA, Explained in Detail
…
In this video I have explained:-
1) With Diagram How to Construct a Minimization of DFA
2) By using State - Partition Table , How to Minimize the DFA
Timetable:-
0:52- Diagram of Minimization of DFA, Explained in Detail
…
Forwarded from Gate CS Coaching
Subject - Theory of Computation
Topic - 80 Theory of Computation | Minimization of DFA by state partition Table Example 2 | Minimal DFA
Link:-https://youtu.be/NuOxGqdwhys
Topic - 80 Theory of Computation | Minimization of DFA by state partition Table Example 2 | Minimal DFA
Link:-https://youtu.be/NuOxGqdwhys
YouTube
80 Theory of Computation | Minimization of DFA by State Partition Table Example 2 | Minimal DFA
Welcome to Gate CS Coaching.
In this video I have explained:-
1) With Diagram How to Construct a Minimization of DFA
2) By using State - Partition Table , How to Minimize the DFA
Timetable:-
0:52- Diagram of Minimization of DFA, Explained in Detail
…
In this video I have explained:-
1) With Diagram How to Construct a Minimization of DFA
2) By using State - Partition Table , How to Minimize the DFA
Timetable:-
0:52- Diagram of Minimization of DFA, Explained in Detail
…
Subject - Theory of Computation
Topic - 81 Gate 2007 Questions on Minimization of DFA | Consider the following Finite state automation
Link:-
https://youtu.be/WLze1mAFhzc
Topic - 81 Gate 2007 Questions on Minimization of DFA | Consider the following Finite state automation
Link:-
https://youtu.be/WLze1mAFhzc
YouTube
81 Gate 2007 Questions on Minimization of DFA | Consider the following Finite state automation
Welcome to Gate CS Coaching.
In this video I have explained:-
1) Gate Previous Year Question on Minimization of DFA
Timetable:-
0:49- Gate Previous Year Question on Minimization of DFA
Consider the following Finite state automation:
…
In this video I have explained:-
1) Gate Previous Year Question on Minimization of DFA
Timetable:-
0:49- Gate Previous Year Question on Minimization of DFA
Consider the following Finite state automation:
…
Subject - Theory of Computation
Topic - 82 Theory of Computation | Minimization of DFA by state partition Table Example 3 | Minimal DFA
Link:- https://youtu.be/B3Ty2l20zxQ
Topic - 82 Theory of Computation | Minimization of DFA by state partition Table Example 3 | Minimal DFA
Link:- https://youtu.be/B3Ty2l20zxQ
YouTube
82 Theory of Computation | Minimization of DFA by State Partition Table Example 3 | Minimal DFA
Welcome to Gate CS Coaching.
In this video I have explained:-
1) How to Minimize the DFA
2) With State Transition Table, Minimizing the DFA
3) Minimization of DFA by state partition method
Timetable:-
1:00- How to Minimize Given DFA, Explained in Detail…
In this video I have explained:-
1) How to Minimize the DFA
2) With State Transition Table, Minimizing the DFA
3) Minimization of DFA by state partition method
Timetable:-
1:00- How to Minimize Given DFA, Explained in Detail…
Subject - Theory of Computation
Topic - 83 Theory of Computation | Minimization of DFA by state partition Table Example 4 | Minimal DFA
Link:- https://youtu.be/g1GfbEsTRuI
Topic - 83 Theory of Computation | Minimization of DFA by state partition Table Example 4 | Minimal DFA
Link:- https://youtu.be/g1GfbEsTRuI
YouTube
83 Theory of Computation | Minimization of DFA by State Partition Table Example 4 | Minimal DFA
Welcome to Gate CS Coaching.
In this video I have explained:-
1) How to Minimize the DFA
2) State Transition Table to Minimize the DFA
Timetable:-
0:49- Minimization of DFA with Diagram, Explained in Detail
1:20- Making State Transition Table to Minimize…
In this video I have explained:-
1) How to Minimize the DFA
2) State Transition Table to Minimize the DFA
Timetable:-
0:49- Minimization of DFA with Diagram, Explained in Detail
1:20- Making State Transition Table to Minimize…
Subject - Theory of Computation
Topic - 85 Theory of Computation | NFA (Non - Deterministic Finite Automata) | Construction of NFA | Examples
Link:-https://youtu.be/LhR1g8g_2xg
Topic - 85 Theory of Computation | NFA (Non - Deterministic Finite Automata) | Construction of NFA | Examples
Link:-https://youtu.be/LhR1g8g_2xg
YouTube
85 Theory of Computation | NFA (Non-Deterministic Finite Automata) | Construction of NFA | Examples
Welcome to Gate CS Coaching.
In this video I have explained:-
1) What is NFA (Non-Deterministic Finite Automata)
2) Note of NFA
3) Questions on NFA
3) Construction of NFA
Timetable:-
1:13- What is NFA (Non-Deterministic Finite Automata), Explained in Detail…
In this video I have explained:-
1) What is NFA (Non-Deterministic Finite Automata)
2) Note of NFA
3) Questions on NFA
3) Construction of NFA
Timetable:-
1:13- What is NFA (Non-Deterministic Finite Automata), Explained in Detail…
Subject - Theory of Computation
Topic - 86 Theory of Computation | Conversion of NFA to DFA | Gate Questions on Conversion of NFA to DFA
Link:- https://youtu.be/UuiZSQGg0Xw
Topic - 86 Theory of Computation | Conversion of NFA to DFA | Gate Questions on Conversion of NFA to DFA
Link:- https://youtu.be/UuiZSQGg0Xw
YouTube
86 Theory of Computation | Conversion of NFA to DFA | Gate Questions on Conversion of NFA to DFA
Welcome to Gate CS Coaching.
In this video I have explained:-
1) How to Convert NFA to DFA
2) Conversion of NFA to DFA
3) What is the Procedure for Conversion of NFA to DFA, Explained in Detail
4) Questions on Conversion of NFA to DFA
5) Gate 2008 Previous…
In this video I have explained:-
1) How to Convert NFA to DFA
2) Conversion of NFA to DFA
3) What is the Procedure for Conversion of NFA to DFA, Explained in Detail
4) Questions on Conversion of NFA to DFA
5) Gate 2008 Previous…
Subject - Theory of Computation
Topic - Lecture 87,88 & 89 Theory of Computation | Complement Of NFA With Problems
Link: 1- https://youtu.be/ulBODa8vMgI
Link 2:- https://youtu.be/ulBODa8vMgI
Link 3:- https://youtu.be/OJkFx16aGXE
Topic - Lecture 87,88 & 89 Theory of Computation | Complement Of NFA With Problems
Link: 1- https://youtu.be/ulBODa8vMgI
Link 2:- https://youtu.be/ulBODa8vMgI
Link 3:- https://youtu.be/OJkFx16aGXE
YouTube
87 Theory of Computation | Complement of NFA | Difference between complement of NFA and DFA
Welcome to Gate CS Coaching.
In this video I have explained:-
1) Complement of NFA
2) What is Complement of NFA?
3) Example on Complement of NFA, Explained in Detail
4) Complement of Finite Automata
5) Difference between complement of NFA and DFA
Timetable:…
In this video I have explained:-
1) Complement of NFA
2) What is Complement of NFA?
3) Example on Complement of NFA, Explained in Detail
4) Complement of Finite Automata
5) Difference between complement of NFA and DFA
Timetable:…
Subject-Theory ot Computation
Topic - 90 Theory of Computation | PSU Question | How many DFA exist with 'n' states over 'm' input alphabet
Link:-https://youtu.be/_uJgTZ84ma8
Topic - 90 Theory of Computation | PSU Question | How many DFA exist with 'n' states over 'm' input alphabet
Link:-https://youtu.be/_uJgTZ84ma8
YouTube
90 Theory of Computation | PSU Question | How many DFA exist with 'n' states over 'm' input alphabet
Welcome to Gate CS Coaching.
In this video I have explained:-
1) How many DFA's exist with 'n' states over 'm' input alphabets
2) What are the Three parts of DFA which we can Change?
3) If we make any NFA OR DFA in any state, How many things are Required…
In this video I have explained:-
1) How many DFA's exist with 'n' states over 'm' input alphabets
2) What are the Three parts of DFA which we can Change?
3) If we make any NFA OR DFA in any state, How many things are Required…
Subject - Theory of Computation
Topic - 91 Theory of Computation | ISRO 2014 Finite Automata Question | The number of state of FSM required
Link:-https://youtu.be/_2HpyOYM0Lo
Topic - 91 Theory of Computation | ISRO 2014 Finite Automata Question | The number of state of FSM required
Link:-https://youtu.be/_2HpyOYM0Lo
YouTube
91 Theory of Computation | ISRO 2014 Finite Automata Question | The number of state of FSM required
Welcome to Gate CS Coaching.
In this video I have explained:-
1) ISRO 2014 Questions on Finite Automata
Timetable:-
0:50- ISRO 2014 PSU Questions:-
1) The number of state of FSM required to stimulate the behaviours of a computer with a memory capable…
In this video I have explained:-
1) ISRO 2014 Questions on Finite Automata
Timetable:-
0:50- ISRO 2014 PSU Questions:-
1) The number of state of FSM required to stimulate the behaviours of a computer with a memory capable…
Subject - Theory of Computation
Topic - Lecture 92, 93 and 94 Theory of Computation | Epsilon NFA | DFA V/S NFA | Conversion of epsilon NFA to DFA
Lecture 92- https://youtu.be/DZLJ-0Tw0wU
Lecture 93:-https://youtu.be/tXgfSDNWEMI
Lecture 94:- https://youtu.be/zGJwFuKiw8Q
Topic - Lecture 92, 93 and 94 Theory of Computation | Epsilon NFA | DFA V/S NFA | Conversion of epsilon NFA to DFA
Lecture 92- https://youtu.be/DZLJ-0Tw0wU
Lecture 93:-https://youtu.be/tXgfSDNWEMI
Lecture 94:- https://youtu.be/zGJwFuKiw8Q
YouTube
92 Theory of Computation | Epsilon NFA | Epsilon Transition | Difference between NFA and Epsilon NFA
Welcome to Gate CS Coaching.
In this video I have explained:-
1) What is Epsilon NFA
2) What is the Difference between NFA and Epsilon NFA
3) What is Epsilon Transition?
4) Note of Epsilon NFA, Explained in Detail
Timetable:-
0:50- What is Epsilon NFA…
In this video I have explained:-
1) What is Epsilon NFA
2) What is the Difference between NFA and Epsilon NFA
3) What is Epsilon Transition?
4) Note of Epsilon NFA, Explained in Detail
Timetable:-
0:50- What is Epsilon NFA…
Subject - Theory of Computation
Topic - 95 Theory of Computation | FA with Output | Moore Machine V/S Mealy Machine | Output Machine
Link:-https://youtu.be/2WYPKte8QjQ
Topic - 95 Theory of Computation | FA with Output | Moore Machine V/S Mealy Machine | Output Machine
Link:-https://youtu.be/2WYPKte8QjQ
YouTube
95 Theory of Computation | FA With Output | Moore Machine V/S Mealy Machine | Output Machine
Welcome to Gate CS Coaching.
In this video I have explained:-
1) What is FA With Output
2) What is the Difference Between Moore Machine and Mealy Machine
3) What are the Types of FA With Output
4) What are the Notes of Moore Machine and Mealy Machine
…
In this video I have explained:-
1) What is FA With Output
2) What is the Difference Between Moore Machine and Mealy Machine
3) What are the Types of FA With Output
4) What are the Notes of Moore Machine and Mealy Machine
…
Subject - Theory of Computation
Topic - 96 Theory of Computation | Moore Machine which gives output 1 for every occurence of substring ab
Link:-https://youtu.be/E2x_7OZDJUE
Topic - 96 Theory of Computation | Moore Machine which gives output 1 for every occurence of substring ab
Link:-https://youtu.be/E2x_7OZDJUE
YouTube
96 Theory of Computation | Moore Machine which gives Output 1 for every occurrence of substring ab
Welcome to Gate CS Coaching.
In this video I have explained:-
1) Moore Machine which gives Output 1 for every occurrence of ab
2) Construct a Moore Machine that takes sets of all Strings over {a , b} and i/p and print 1 as o/p for every Occurrence of 'ab'…
In this video I have explained:-
1) Moore Machine which gives Output 1 for every occurrence of ab
2) Construct a Moore Machine that takes sets of all Strings over {a , b} and i/p and print 1 as o/p for every Occurrence of 'ab'…
Subject - Theory of Computation
Topic - Lecture 97, 98,99 and 100 Theory of Computation | Moore Machine Construction | Different kind of Moore Machine
Lecture 97-https://youtu.be/UBxgNuyoUs4
Lecture 98:-https://youtu.be/nxZiMGyuhlw
Lecture 99:-https://youtu.be/q9aVKftBTx8
Lecture 100:-https://youtu.be/KhH3cqkRHnk
Topic - Lecture 97, 98,99 and 100 Theory of Computation | Moore Machine Construction | Different kind of Moore Machine
Lecture 97-https://youtu.be/UBxgNuyoUs4
Lecture 98:-https://youtu.be/nxZiMGyuhlw
Lecture 99:-https://youtu.be/q9aVKftBTx8
Lecture 100:-https://youtu.be/KhH3cqkRHnk
YouTube
97 Theory of Computation | Moore Machine which gives Output 1 for every occurrence of substring baa
Welcome to Gate CS Coaching.
In this video I have explained:-
1) Construction of Moore Machine
2) Moore Machine which gives Output 1 for every occurrence of substring baa, Explained in Detail
Timetable:-
0:55- Construct a Moore Machine which gives Output…
In this video I have explained:-
1) Construction of Moore Machine
2) Moore Machine which gives Output 1 for every occurrence of substring baa, Explained in Detail
Timetable:-
0:55- Construct a Moore Machine which gives Output…
Subject - Theory of Computation
Topic - 101 Theory of Computation | How to do 1st and 2's Complement | Short - Cut of 1st and 2's Complement
Link:-https://youtu.be/fPX87eC1Np4
Topic - 101 Theory of Computation | How to do 1st and 2's Complement | Short - Cut of 1st and 2's Complement
Link:-https://youtu.be/fPX87eC1Np4
YouTube
101 Theory of Computation | How to do 1st and 2's Complement | Short-Cut of 1st and 2's Complement
Welcome to Gate CS Coaching.
In this video I have explained:-
1) 1st Complement and 2's Complement
2) How to do 1st Complement and 2's Complement?
3) What are the Example of 2's Complement?
4) What is the Procedure (Short-Cut) of 1st Complement and 2's…
In this video I have explained:-
1) 1st Complement and 2's Complement
2) How to do 1st Complement and 2's Complement?
3) What are the Example of 2's Complement?
4) What is the Procedure (Short-Cut) of 1st Complement and 2's…