TopGATE
TopGATE
  • 70
  • 80 020
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
Переглядів: 462

Відео

2.7 GATE Questions on Critical Section Problem | Practice Problems on Process Synchronization15:082.7 GATE Questions on Critical Section Problem | Practice Problems on Process Synchronization
2.7 GATE Questions on Critical Section Problem | Practice Problems on Process Synchronization
Переглядів 3939 місяців тому
GATE Questions on Critical Section Problem | GATE Questions on Process Synchronization
2.6 Peterson Solution | Critical Section Problem Solution | Dekker's Algo | Process Synchronization17:192.6 Peterson Solution | Critical Section Problem Solution | Dekker's Algo | Process Synchronization
2.6 Peterson Solution | Critical Section Problem Solution | Dekker's Algo | Process Synchronization
Переглядів 2459 місяців тому
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 Variable11:362.5 Solution to the Critical Section Problem involving Two Processes using Flag 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 Variable13:352.4 Solution to the Critical Section Problem involving Two Processes using Turn Variable
2.4 Solution to the Critical Section Problem involving Two Processes using Turn Variable
Переглядів 23110 місяців тому
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 OS17:242.3 Critical Section Problem | Mutual Exclusion | Progress | Bounded Waiting | CS Problem in OS
2.3 Critical Section Problem | Mutual Exclusion | Progress | Bounded Waiting | CS Problem in OS
Переглядів 30610 місяців тому
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 Synchronization12:292.2 Important Question on Race Condition | GATE Question on Race Condition | Process Synchronization
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 OS12:292.1 Race Condition in Operating System | Process Synchronization in OS
2.1 Race Condition in Operating System | Process Synchronization in OS
Переглядів 25511 місяців тому
Race condition, process synchronization, operating system, race condition example
1.17 Example of Round Robin Scheduling Algorithm in English | CPU Scheduling12:211.17 Example of Round Robin Scheduling Algorithm in English | CPU Scheduling
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 Algorithm15:591.16 Round Robin Scheduling Algorithm | CPU Scheduling | Example of Round Robin Scheduling Algorithm
1.16 Round Robin Scheduling Algorithm | CPU Scheduling | Example of Round Robin Scheduling Algorithm
Переглядів 47411 місяців тому
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 Algo10:221.15 GATE question on Preemptive Priority Scheduling Algorithm | Example of Preemptive Priority Algo
1.15 GATE question on Preemptive Priority Scheduling Algorithm | Example of Preemptive Priority Algo
Переглядів 15911 місяців тому
Preemptive Priority Scheduling Algorithm example of Preemptive Priority Algorithm
1.14 Preemptive Priority Scheduling Algorithm in OS | Example of Preemptive Priority Scheduling Algo8:521.14 Preemptive Priority Scheduling Algorithm in OS | Example of Preemptive Priority Scheduling Algo
1.14 Preemptive Priority Scheduling Algorithm in OS | Example of Preemptive Priority Scheduling Algo
Переглядів 17111 місяців тому
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 FCFS10:331.9 Convoy Effect in First Come First Serve Scheduling Algorithm | Convoy Effect in FCFS
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 ua-cam.com/video/wztIrp_EQ00/v-deo.html
1.13 Non Preemptive Priority Scheduling Algorithm | Priority Scheduling Algorithm with Example13:171.13 Non Preemptive Priority Scheduling Algorithm | Priority Scheduling Algorithm with Example
1.13 Non Preemptive Priority Scheduling Algorithm | Priority Scheduling Algorithm with Example
Переглядів 30611 місяців тому
Priority scheduling non preemptive priority scheduling algorithm
1.12 Examples of Shortest Remaining Time First Scheduling Algorithm | Preemptive SJF in English15:391.12 Examples of Shortest Remaining Time First Scheduling Algorithm | Preemptive SJF in English
1.12 Examples of Shortest Remaining Time First Scheduling Algorithm | Preemptive SJF in English
Переглядів 28611 місяців тому
Examples of Shortest Remaining Time First Scheduling Algorithm Preemptive SJF in English
1.11 Shortest Remaining Time First (SRTF) Scheduling Algorithm | Preemptive Shortest Job First12:531.11 Shortest Remaining Time First (SRTF) Scheduling Algorithm | Preemptive Shortest Job First
1.11 Shortest Remaining Time First (SRTF) Scheduling Algorithm | Preemptive Shortest Job First
Переглядів 1 тис.11 місяців тому
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 English14:131.10 Shortest Job First (SJF) Scheduling Algorithm | Non Preemptive SJF Algorithm in English
1.10 Shortest Job First (SJF) Scheduling Algorithm | Non Preemptive SJF Algorithm in English
Переглядів 42811 місяців тому
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 Example15:241.8 First Come First Serve CPU Scheduling Algorithm | FCFS Algorithm with Example
1.8 First Come First Serve CPU Scheduling Algorithm | FCFS Algorithm with Example
Переглядів 27311 місяців тому
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 Time7:321.7 Scheduling Criteria in OS | Arrival Time | Burst Time | Waiting Time | Turnaround Time
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 English10:371.6 Preemptive vs Non Preemptive CPU Scheduling | CPU Scheduling in English
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 Burst8:561.5 CPU Scheduling in OS | Process Scheduling | CPU Burst vs I/O Burst
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 System8:031.4 Multitasking Operating System | Time Sharing Operating System
1.4 Multitasking Operating System | Time Sharing Operating System
Переглядів 16611 місяців тому
1.4 Multitasking Operating System | Time Sharing Operating System
1.3 Multiprogramming Operating System in English | What is Multiprogramming Operating System7:311.3 Multiprogramming Operating System in English | What is Multiprogramming 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 English13:391.2 Program Vs Process | Process States | Process State Diagram in English
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 |18:041.1 What is an Operating System | Introduction to Operating Systems in English |
1.1 What is an Operating System | Introduction to Operating Systems in English |
Переглядів 55111 місяців тому
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 | TOC6:50NFA Design | All Strings in which Last Symbol is '1' But NOT Containing '00' as a Substring | TOC
NFA Design | All Strings in which Last Symbol is '1' But NOT Containing '00' as a Substring | TOC
Переглядів 1,5 тис.Рік тому
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 | TOC5:08NFA Design | All Strings of (0, 1) having SECOND LAST Symbol as '1' | Automata Theory | TOC
NFA Design | All Strings of (0, 1) having SECOND LAST Symbol as '1' | Automata Theory | TOC
Переглядів 2 тис.Рік тому
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 | TOC7:27Introduction to NFA | Non-Deterministic Finite Automata in English | Automata Theory | TOC
Introduction to NFA | Non-Deterministic Finite Automata in English | Automata Theory | TOC
Переглядів 488Рік тому
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 | TOC7:52DFA Design | All Strings of 'C,H,A,R,I,O,T' having 'CAT' as a Substring | Automata Theory | TOC
DFA Design | All Strings of 'C,H,A,R,I,O,T' having 'CAT' as a Substring | Automata Theory | TOC
Переглядів 833Рік тому
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 | TOC7:43DFA Design | All Binary Strings Divisible by 3 | GATECSE | Automata Theory | TOC
DFA Design | All Binary Strings Divisible by 3 | GATECSE | Automata Theory | TOC
Переглядів 520Рік тому
DFA Design | All Binary Strings Divisible by 3 | GATECSE | Automata Theory | TOC

КОМЕНТАРІ

  • @lohitharavikumar
    @lohitharavikumar 3 дні тому

    sir in 1's compliment when we chane all 1's to 0's and 0's to 1's in 1st iteration why can't we directly write b,b,r and end instead of doing again b,b,l reading the string 0,0,L , 1,1, L and again b,b,r?

    • @topgate4u
      @topgate4u 21 хвилина тому

      The only reason why we did this is that we want the r/w head on the first symbol from where the changed string is starting.

  • @computerscienceenggtutoria3323
    @computerscienceenggtutoria3323 4 дні тому

    Brilliant video. This subject is difficult but your explaination made the topic a breeze. I am sure this will make learning easier and it will be a hit among the students. Looking forward for more videos.

    • @topgate4u
      @topgate4u 24 хвилини тому

      Thank you so much for your appreciation!

  • @tri_suyash.
    @tri_suyash. 4 дні тому

    design a Deterministic Finite Automaton (DFA) that accepts strings starting and ending with the same symbol and containing an even number of 'a's and 'b'

  • @samueltcv3350
    @samueltcv3350 24 дні тому

    the best

  • @sandeepmandrawadkar9133
    @sandeepmandrawadkar9133 26 днів тому

    Excellent explanation 👌

  • @aryanpatil49
    @aryanpatil49 27 днів тому

    Thank you. Explained very neatly and also the expression was dry run well. Lovely

  • @hardikmakwana4266
    @hardikmakwana4266 2 місяці тому

    tq sir

  • @parkhibhandula5664
    @parkhibhandula5664 2 місяці тому

    Thanks you explained it really well 😊

  • @devilonstudio7587
    @devilonstudio7587 2 місяці тому

    Well done

  • @suhailtheory
    @suhailtheory 2 місяці тому

    good

  • @ApparentlyIamAaditya
    @ApparentlyIamAaditya 3 місяці тому

    thx a lot

  • @muhammadfaiz28
    @muhammadfaiz28 4 місяці тому

    Thanks Fahad sir, it was a great experience learning DBMS with you and today theory of computation

    • @topgate4u
      @topgate4u 3 місяці тому

      Truely delighted to hear that!!!!

  • @MuhammadRizky-xu7bj
    @MuhammadRizky-xu7bj 4 місяці тому

    very amazing, i am student from indonesia

    • @topgate4u
      @topgate4u 4 місяці тому

      Glad it helped you!

  • @mohanawasthi7045
    @mohanawasthi7045 4 місяці тому

    thanks sir

    • @topgate4u
      @topgate4u 4 місяці тому

      Most Welcome! Best of luck for your preperations!

  • @infinity8982
    @infinity8982 5 місяців тому

    Sir right before final state shouldn't it be B, B/L??

    • @topgate4u
      @topgate4u 5 місяців тому

      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.

  • @RaissaFernandes-pt8wk
    @RaissaFernandes-pt8wk 5 місяців тому

    very good explanation, better than most video's out there

    • @topgate4u
      @topgate4u 4 місяці тому

      Glad it was helpful!

  • @Project_coccon
    @Project_coccon 5 місяців тому

    Thank u sir

  • @sakthi_chesz
    @sakthi_chesz 5 місяців тому

    3.55 see sir , 001 ( end with 1 ) q1 is not Final state then how its possible ? Pls reply fast tomorrow my sem exam

    • @topgate4u
      @topgate4u 5 місяців тому

      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.

  • @SimplyAyman.
    @SimplyAyman. 5 місяців тому

    thanks topG

  • @emnasellami4490
    @emnasellami4490 6 місяців тому

    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)?

    • @topgate4u
      @topgate4u 6 місяців тому

      Yes, in this particular question, that can be done. Just to make it more easy to understad, I have taken seperate paths.

  • @mahikabhardwaj8915
    @mahikabhardwaj8915 6 місяців тому

    Great explanation!!! understood it soo quickly.. tysm

  • @maysam7083
    @maysam7083 6 місяців тому

    thank you so much

    • @topgate4u
      @topgate4u 6 місяців тому

      You're welcome!

  • @lisandronascimento
    @lisandronascimento 6 місяців тому

    Marvelous!

  • @harigona3405
    @harigona3405 6 місяців тому

    Sir You best of alll. Unsung Hero.

    • @topgate4u
      @topgate4u 6 місяців тому

      Glad you liked it!

  • @chintalagreeshma4664
    @chintalagreeshma4664 6 місяців тому

    Sir if W BELONGS TO(a+b) ^+ can we do this sum pls reply sir

    • @topgate4u
      @topgate4u 6 місяців тому

      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

    • @chintalagreeshma4664
      @chintalagreeshma4664 6 місяців тому

      @@topgate4u but i asked for (a+b) ^+

    • @topgate4u
      @topgate4u 6 місяців тому

      @@chintalagreeshma4664 (a,b)^+ and (a+b)^+ both are same.

    • @chintalagreeshma4664
      @chintalagreeshma4664 6 місяців тому

      @@topgate4u can u make a video for the question I asked pls I have exam

  • @Gamer516yt
    @Gamer516yt 6 місяців тому

    make the q4 as final state sir

    • @topgate4u
      @topgate4u 6 місяців тому

      This turing machine is a transducer, i.e., it converts a string from one form to another, hence there is no final state.

  • @ShreyaSeth1416
    @ShreyaSeth1416 6 місяців тому

    Sir when we have to change the state in PDA ?

    • @topgate4u
      @topgate4u 6 місяців тому

      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!

  • @HadilLatreche-fk2kj
    @HadilLatreche-fk2kj 6 місяців тому

    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

    • @topgate4u
      @topgate4u 6 місяців тому

      I will soon make the videos on Grammars...

  • @vamsivelagada
    @vamsivelagada 7 місяців тому

    Great explanation sir... Beginner friendly tutorial..

    • @topgate4u
      @topgate4u 6 місяців тому

      Thanks and welcome

  • @swapnilvalvekar8779
    @swapnilvalvekar8779 7 місяців тому

    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??

    • @topgate4u
      @topgate4u 7 місяців тому

      Yes bbbb will be accepted. Since bbbb contains 0 (zero) number of a's which is considered to be an even number.

    • @swapnilvalvekar8779
      @swapnilvalvekar8779 7 місяців тому

      @@topgate4u ok sir thank you

  • @zahraali2858
    @zahraali2858 7 місяців тому

    Thank you so much, this has really helped me

    • @topgate4u
      @topgate4u 6 місяців тому

      Glad it helped!

  • @lazzy5173
    @lazzy5173 7 місяців тому

    This came in my exam along with converting to RE. Couldn't get it 😭

  • @YasarAmeen-h3i
    @YasarAmeen-h3i 8 місяців тому

    ek he baar may samaj aagaya tq

  • @abdelrahmanashraf2992
    @abdelrahmanashraf2992 8 місяців тому

    very well explained!

  • @TheShadod
    @TheShadod 8 місяців тому

    Great cand clear explanation, thank you so much

  • @TunerXMusic4u
    @TunerXMusic4u 9 місяців тому

    Thanks❤❤

  • @ozcankucuk9008
    @ozcankucuk9008 9 місяців тому

    Hello, how should (ab*)ⁿ(c+d)ⁿ be a Turing machine everywhere?

  • @shivaboinofficial8784
    @shivaboinofficial8784 10 місяців тому

    Worth sir ..

  • @astergaming2261
    @astergaming2261 10 місяців тому

    tq sir tmr my exam your valuable video help me a lot tqqqq so much sir

    • @topgate4u
      @topgate4u 10 місяців тому

      All the best

  • @astergaming2261
    @astergaming2261 10 місяців тому

    just wow

  • @RehanaFasih-w8b
    @RehanaFasih-w8b 11 місяців тому

    Very informative lecture

  • @ShabbirAhmad-h3s1c
    @ShabbirAhmad-h3s1c 11 місяців тому

    Very good explanation

  • @ashisharunchaudhary7937
    @ashisharunchaudhary7937 11 місяців тому

    Nice...

  • @carlosandresordonezceron5395
    @carlosandresordonezceron5395 11 місяців тому

    I was so tired looking for some tutorial to understand this excercise, thank you, it was the best!

    • @topgate4u
      @topgate4u 11 місяців тому

      Glad it was helpful!

  • @khushpatel9983
    @khushpatel9983 11 місяців тому

    very well explanation.

  • @melsywsou
    @melsywsou 11 місяців тому

    Thank you. Your explanation made it finally click in my head!

  • @josiahjoel7580
    @josiahjoel7580 11 місяців тому

    Very well explained sir. I appreciate you taking the time to go through each iteration. Thank you sir.

  • @banbana12
    @banbana12 11 місяців тому

    good job

  • @ETIS
    @ETIS Рік тому

    Nice Explanation

  • @aliarain7037
    @aliarain7037 Рік тому

    Sir Is Ka RE Kia Ho ga ?