- 70
- 77 343
TopGATE
India
เข้าร่วมเมื่อ 28 ก.พ. 2023
Welcome to my TH-cam channel "TopGATE". This channel is specifically created for the students of Computer Science & Engineering and related fields who want to crack GATE, NET and other competitive exams. The videos uploaded in this channel will not only help the GATE and NET aspirants but it will also prove out to be very beneficial for the students of Engineering.
All the important concepts will be discussed in English so that a vast majority of students may get benefitted.
To keep me motivated:
1. Subscribe the channel
2. Like the videos
3. Comment on the videos
4. Share with your friends
Good Luck for your ENGINEERING and GATE journey!
All the important concepts will be discussed in English so that a vast majority of students may get benefitted.
To keep me motivated:
1. Subscribe the channel
2. Like the videos
3. Comment on the videos
4. Share with your friends
Good Luck for your ENGINEERING and GATE journey!
DFA Design | All Strings Starting with 'a' AND NOT Ending with 'b' | Automata Theory | TOC
finite automata examples
lecture notes finite automata
non deterministic finite automata
regular expression
pushdown automata
finite automata tutorial
deterministic finite automata
nondeterministic finite automata
lecture notes finite automata
finite automata examples ppt
what is finite automata
nondeterministic finite automata examples
finite automata tutorial
finite automata examples with solution
deterministic finite automata solved examples
finite automata examples pdf
pushdown automata examples
pushdown automata solved examples
pushdown automata tutorial
turing machine
pushdown automata pdf
pushdown automata ppt
pushdown automata notes
context free grammar
example automata
deterministic finite automata tutorial
finite automata examples
how to draw finite automata
difference between finite automata transition graph
probabilistic finite state automata
dfa tutorial
finite state automata examples
deterministic finite automata solved examples
deterministic finite automata problems with solutions
deterministic finite automata examples
difference between dfa and nfa
deterministic finite automata tutorial
non deterministic finite automata
deterministic finite automata problems
deterministic finite automata pdf
nondeterministic finite automata examples
nondeterministic finite automata tutorial
nondeterministic finite automata problems
nondeterministic finite automata ppt
nondeterministic finite automata to deterministic
difference between deterministic and nondeterministic finite automata
nondeterministic finite automata exercises
nondeterministic finite automata regular expression
learning regular languages non deterministic finite automata
non deterministic finite automata examples
nondeterministic finite automata examples pdf
nondeterministic finite automata applications
nondeterministic finite automata ppt
nondeterministic finite automata are more powerful than deterministic finite automata
nondeterministic finite automata to deterministic finite automata
nondeterministic finite automata to regular expression
finite automata tutorial
automata theory questions answers pdf
finite automata examples
lecture notes finite automata
automata theory lecture notes
finite automata and formal languages notes
finite automata and formal languages
formal language and automata theory
finite automata examples finite automata ppt
non deterministic finite automata
pushdown automata
lecture notes finite automata
finite automata tutorial
Finite Automata
Informally, a state machine that comprehensively
captures all possible states and transitions that a machine can take while responding to a stream (or machine can take while responding to a stream (or sequence) of input symbols
Recognizer for “Regular Languages”
Deterministic Finite Automata (DFA)
The machine can exist in only one state at any given time
Non-deterministic Finite Automata (NFA)
The machine can exist in multiple states at the same time
lecture notes finite automata
lecture notes finite automata
non deterministic finite automata
regular expression
pushdown automata
finite automata tutorial
deterministic finite automata
nondeterministic finite automata
lecture notes finite automata
finite automata examples ppt
what is finite automata
nondeterministic finite automata examples
finite automata tutorial
finite automata examples with solution
deterministic finite automata solved examples
finite automata examples pdf
pushdown automata examples
pushdown automata solved examples
pushdown automata tutorial
turing machine
pushdown automata pdf
pushdown automata ppt
pushdown automata notes
context free grammar
example automata
deterministic finite automata tutorial
finite automata examples
how to draw finite automata
difference between finite automata transition graph
probabilistic finite state automata
dfa tutorial
finite state automata examples
deterministic finite automata solved examples
deterministic finite automata problems with solutions
deterministic finite automata examples
difference between dfa and nfa
deterministic finite automata tutorial
non deterministic finite automata
deterministic finite automata problems
deterministic finite automata pdf
nondeterministic finite automata examples
nondeterministic finite automata tutorial
nondeterministic finite automata problems
nondeterministic finite automata ppt
nondeterministic finite automata to deterministic
difference between deterministic and nondeterministic finite automata
nondeterministic finite automata exercises
nondeterministic finite automata regular expression
learning regular languages non deterministic finite automata
non deterministic finite automata examples
nondeterministic finite automata examples pdf
nondeterministic finite automata applications
nondeterministic finite automata ppt
nondeterministic finite automata are more powerful than deterministic finite automata
nondeterministic finite automata to deterministic finite automata
nondeterministic finite automata to regular expression
finite automata tutorial
automata theory questions answers pdf
finite automata examples
lecture notes finite automata
automata theory lecture notes
finite automata and formal languages notes
finite automata and formal languages
formal language and automata theory
finite automata examples finite automata ppt
non deterministic finite automata
pushdown automata
lecture notes finite automata
finite automata tutorial
Finite Automata
Informally, a state machine that comprehensively
captures all possible states and transitions that a machine can take while responding to a stream (or machine can take while responding to a stream (or sequence) of input symbols
Recognizer for “Regular Languages”
Deterministic Finite Automata (DFA)
The machine can exist in only one state at any given time
Non-deterministic Finite Automata (NFA)
The machine can exist in multiple states at the same time
lecture notes finite automata
มุมมอง: 438
วีดีโอ
2.7 GATE Questions on Critical Section Problem | Practice Problems on Process Synchronization
มุมมอง 3879 หลายเดือนก่อน
GATE Questions on Critical Section Problem | GATE Questions on Process Synchronization
2.6 Peterson Solution | Critical Section Problem Solution | Dekker's Algo | Process Synchronization
มุมมอง 2449 หลายเดือนก่อน
Correct Solution to the Critical Section Problem involving Two Processes using Flag & Turn Variable
2.5 Solution to the Critical Section Problem involving Two Processes using Flag Variable
มุมมอง 2739 หลายเดือนก่อน
Solution to the Critical Section Problem involving Two Processes using Flag Variable
2.4 Solution to the Critical Section Problem involving Two Processes using Turn Variable
มุมมอง 2299 หลายเดือนก่อน
Solution to the Critical Section Problem involving Two Processes using Turn Variable
2.3 Critical Section Problem | Mutual Exclusion | Progress | Bounded Waiting | CS Problem in OS
มุมมอง 30210 หลายเดือนก่อน
The critical section problem is a classic synchronization problem in computer science and concurrent programming. It involves multiple processes or threads that share a common resource, such as memory or a file, and need to ensure that only one process at a time can access or modify that resource. The goal is to prevent data inconsistency or race conditions that may arise when multiple processe...
2.2 Important Question on Race Condition | GATE Question on Race Condition | Process Synchronization
มุมมอง 13311 หลายเดือนก่อน
Important Question on Race Condition GATE Question on Race Condition Process Synchronization
2.1 Race Condition in Operating System | Process Synchronization in OS
มุมมอง 25411 หลายเดือนก่อน
Race condition, process synchronization, operating system, race condition example
1.17 Example of Round Robin Scheduling Algorithm in English | CPU Scheduling
มุมมอง 21011 หลายเดือนก่อน
Round Robin Scheduling Algorithm Process Scheduling CPU Scheduling
1.16 Round Robin Scheduling Algorithm | CPU Scheduling | Example of Round Robin Scheduling Algorithm
มุมมอง 47211 หลายเดือนก่อน
Round Robin Scheduling Algorithm, CPU Scheduling, Example of Round Robin Scheduling Algorithm
1.15 GATE question on Preemptive Priority Scheduling Algorithm | Example of Preemptive Priority Algo
มุมมอง 15711 หลายเดือนก่อน
Preemptive Priority Scheduling Algorithm example of Preemptive Priority Algorithm
1.14 Preemptive Priority Scheduling Algorithm in OS | Example of Preemptive Priority Scheduling Algo
มุมมอง 17011 หลายเดือนก่อน
Priority Scheduling algorithm preemptive priority scheduling algorithm an example of preemptive priority scheduling algorithm
1.9 Convoy Effect in First Come First Serve Scheduling Algorithm | Convoy Effect in FCFS
มุมมอง 14911 หลายเดือนก่อน
The convoy effect is seen in the FCFS algorithm if the burst time of the first job entering the ready queue of the CPU is the highest of all. If the CPU acquires the processes with higher burst time at the front end of the ready queue then those processes which have lower burst time may get blocked. FCFS Scheduling Algorithm th-cam.com/video/wztIrp_EQ00/w-d-xo.html
1.13 Non Preemptive Priority Scheduling Algorithm | Priority Scheduling Algorithm with Example
มุมมอง 30311 หลายเดือนก่อน
Priority scheduling non preemptive priority scheduling algorithm
1.12 Examples of Shortest Remaining Time First Scheduling Algorithm | Preemptive SJF in English
มุมมอง 28211 หลายเดือนก่อน
Examples of Shortest Remaining Time First Scheduling Algorithm Preemptive SJF in English
1.11 Shortest Remaining Time First (SRTF) Scheduling Algorithm | Preemptive Shortest Job First
มุมมอง 99311 หลายเดือนก่อน
1.11 Shortest Remaining Time First (SRTF) Scheduling Algorithm | Preemptive Shortest Job First
1.10 Shortest Job First (SJF) Scheduling Algorithm | Non Preemptive SJF Algorithm in English
มุมมอง 42111 หลายเดือนก่อน
1.10 Shortest Job First (SJF) Scheduling Algorithm | Non Preemptive SJF Algorithm in English
1.8 First Come First Serve CPU Scheduling Algorithm | FCFS Algorithm with Example
มุมมอง 27211 หลายเดือนก่อน
1.8 First Come First Serve CPU Scheduling Algorithm | FCFS Algorithm with Example
1.7 Scheduling Criteria in OS | Arrival Time | Burst Time | Waiting Time | Turnaround Time
มุมมอง 14111 หลายเดือนก่อน
1.7 Scheduling Criteria in OS | Arrival Time | Burst Time | Waiting Time | Turnaround Time
1.6 Preemptive vs Non Preemptive CPU Scheduling | CPU Scheduling in English
มุมมอง 18011 หลายเดือนก่อน
1.6 Preemptive vs Non Preemptive CPU Scheduling | CPU Scheduling in English
1.5 CPU Scheduling in OS | Process Scheduling | CPU Burst vs I/O Burst
มุมมอง 16211 หลายเดือนก่อน
1.5 CPU Scheduling in OS | Process Scheduling | CPU Burst vs I/O Burst
1.4 Multitasking Operating System | Time Sharing Operating System
มุมมอง 16511 หลายเดือนก่อน
1.4 Multitasking Operating System | Time Sharing Operating System
1.3 Multiprogramming Operating System in English | What is Multiprogramming Operating System
มุมมอง 17411 หลายเดือนก่อน
1.3 Multiprogramming Operating System in English | What is Multiprogramming Operating System
1.2 Program Vs Process | Process States | Process State Diagram in English
มุมมอง 19111 หลายเดือนก่อน
1.2 Program Vs Process | Process States | Process State Diagram in English
1.1 What is an Operating System | Introduction to Operating Systems in English |
มุมมอง 54911 หลายเดือนก่อน
1.1 What is an Operating System | Introduction to Operating Systems in English |
NFA Design | All Strings in which Last Symbol is '1' But NOT Containing '00' as a Substring | TOC
มุมมอง 1.4Kปีที่แล้ว
NFA Design | All Strings in which Last Symbol is '1' But NOT Containing '00' as a Substring | TOC
NFA Design | All Strings of (0, 1) having SECOND LAST Symbol as '1' | Automata Theory | TOC
มุมมอง 2Kปีที่แล้ว
NFA Design | All Strings of (0, 1) having SECOND LAST Symbol as '1' | Automata Theory | TOC
Introduction to NFA | Non-Deterministic Finite Automata in English | Automata Theory | TOC
มุมมอง 458ปีที่แล้ว
Introduction to NFA | Non-Deterministic Finite Automata in English | Automata Theory | TOC
DFA Design | All Strings of 'C,H,A,R,I,O,T' having 'CAT' as a Substring | Automata Theory | TOC
มุมมอง 821ปีที่แล้ว
DFA Design | All Strings of 'C,H,A,R,I,O,T' having 'CAT' as a Substring | Automata Theory | TOC
DFA Design | All Binary Strings Divisible by 3 | GATECSE | Automata Theory | TOC
มุมมอง 513ปีที่แล้ว
DFA Design | All Binary Strings Divisible by 3 | GATECSE | Automata Theory | TOC
the best
Excellent explanation 👌
Thank you. Explained very neatly and also the expression was dry run well. Lovely
tq sir
Thanks you explained it really well 😊
Well done
good
thx a lot
Thanks Fahad sir, it was a great experience learning DBMS with you and today theory of computation
Truely delighted to hear that!!!!
very amazing, i am student from indonesia
Glad it helped you!
thanks sir
Most Welcome! Best of luck for your preperations!
Sir right before final state shouldn't it be B, B/L??
It can be anything. Since this is the final state and all the work is already done till this point, so whether you use B,B,R or B, B, L both are correct.
very good explanation, better than most video's out there
Glad it was helpful!
Thank u sir
3.55 see sir , 001 ( end with 1 ) q1 is not Final state then how its possible ? Pls reply fast tomorrow my sem exam
The question says that it should accept only those numbers which are divisible by 3 and 001 is not divisible by 3 and hence it should not be accepted. Since it is landing on q1 and q1 is not final, therefore it will not be accepted.
thanks topG
Hey, I have a question: when we wanted to change b to delta, why did we add another path instead of adding it to the same path where we change a to delta (same for x and y to z)?
Yes, in this particular question, that can be done. Just to make it more easy to understad, I have taken seperate paths.
Great explanation!!! understood it soo quickly.. tysm
thank you so much
You're welcome!
Marvelous!
Glad you liked it!
Please, keep up the good work!
Sir You best of alll. Unsung Hero.
Glad you liked it!
Sir if W BELONGS TO(a+b) ^+ can we do this sum pls reply sir
No it will not work for (a,b)+ as this solution is accepting null in w, i.e., if there is only c and nothing on the left and right side of c, then also it will accept it. For (a,b)+, we need a different solution
@@topgate4u but i asked for (a+b) ^+
@@chintalagreeshma4664 (a,b)^+ and (a+b)^+ both are same.
@@topgate4u can u make a video for the question I asked pls I have exam
make the q4 as final state sir
This turing machine is a transducer, i.e., it converts a string from one form to another, hence there is no final state.
Sir when we have to change the state in PDA ?
There is no such rule in PDA that "when to change the state". This we have to do as per the logic. For example, suppose in this example, we have to push "a" first and then "b" into the stack, so on the first state we have taken the transition for "a" and then for "b" we have taken another state. We cannot take the transition for "b" on the first state because if we do so, this PDA will start accepting strings that start with "b". Hope this is clear to you now!
Thank you toooo much , please sir can u explaine me how can i knew that this gramer belong to type 1 or 0 or 2 or 3
I will soon make the videos on Grammars...
Great explanation sir... Beginner friendly tutorial..
Thanks and welcome
For 1 question: sir what if the input is bbbb so here every input is b, then qo will accept all b's because of self loop of b and it will end at qo only which is the final state. So bbbb will be accpeted??
Yes bbbb will be accepted. Since bbbb contains 0 (zero) number of a's which is considered to be an even number.
@@topgate4u ok sir thank you
Thank you so much, this has really helped me
Glad it helped!
This came in my exam along with converting to RE. Couldn't get it 😭
ek he baar may samaj aagaya tq
very well explained!
Great cand clear explanation, thank you so much
Thanks❤❤
Hello, how should (ab*)ⁿ(c+d)ⁿ be a Turing machine everywhere?
Worth sir ..
tq sir tmr my exam your valuable video help me a lot tqqqq so much sir
All the best
just wow
Very informative lecture
Very good explanation
Nice...
I was so tired looking for some tutorial to understand this excercise, thank you, it was the best!
Glad it was helpful!
very well explanation.
Thank you. Your explanation made it finally click in my head!
Very well explained sir. I appreciate you taking the time to go through each iteration. Thank you sir.
good job
Nice Explanation
Thanks for liking
Sir Is Ka RE Kia Ho ga ?
thank you for your video! Help me alot
Glad it helped!
Sir if value of n=1 and m=2 then also we need draw four states or we can go with three states?
The PDA's that we make are used to solve general problems and not the only specific problems, i.e. it will work for all the values of n and m. Whether we take n=1 and m=2 or any other value, the PDA will be the same.
It shows many ads and it is create disturbence
Adds are from TH-cam, we cannot do anything about it!