TopGATE
TopGATE
  • 70
  • 92 305
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
มุมมอง: 534

วีดีโอ

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
มุมมอง 44310 หลายเดือนก่อน
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
มุมมอง 25810 หลายเดือนก่อน
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
มุมมอง 28911 หลายเดือนก่อน
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
มุมมอง 25111 หลายเดือนก่อน
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
มุมมอง 35111 หลายเดือนก่อน
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
มุมมอง 138ปีที่แล้ว
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
มุมมอง 269ปีที่แล้ว
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
มุมมอง 226ปีที่แล้ว
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
มุมมอง 524ปีที่แล้ว
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
มุมมอง 170ปีที่แล้ว
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
มุมมอง 183ปีที่แล้ว
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
มุมมอง 163ปีที่แล้ว
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 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
มุมมอง 331ปีที่แล้ว
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
มุมมอง 314ปีที่แล้ว
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.1Kปีที่แล้ว
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
มุมมอง 485ปีที่แล้ว
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
มุมมอง 282ปีที่แล้ว
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
มุมมอง 146ปีที่แล้ว
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
มุมมอง 188ปีที่แล้ว
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
มุมมอง 166ปีที่แล้ว
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
มุมมอง 186ปีที่แล้ว
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
มุมมอง 182ปีที่แล้ว
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
มุมมอง 197ปีที่แล้ว
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 |
มุมมอง 577ปีที่แล้ว
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.6Kปีที่แล้ว
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.4Kปีที่แล้ว
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
มุมมอง 528ปีที่แล้ว
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
มุมมอง 898ปีที่แล้ว
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
มุมมอง 574ปีที่แล้ว
DFA Design | All Binary Strings Divisible by 3 | GATECSE | Automata Theory | TOC

ความคิดเห็น

  • @NaveenReddy-vm3ps
    @NaveenReddy-vm3ps 5 วันที่ผ่านมา

    Really great video sir, and your english is really fluent 😄

    • @topgate4u
      @topgate4u 5 วันที่ผ่านมา

      Glad you liked the video!

  • @marcc1179
    @marcc1179 11 วันที่ผ่านมา

    This is an assignment given by my professor. I can never come up with a solution on my own. Thanks!

    • @topgate4u
      @topgate4u 8 วันที่ผ่านมา

      I'm glad this video helped you solve the assignment!

  • @rupesh4361
    @rupesh4361 14 วันที่ผ่านมา

    Great explaination sir ! Thank u

    • @topgate4u
      @topgate4u 8 วันที่ผ่านมา

      You are welcome

  • @worldseries.07
    @worldseries.07 18 วันที่ผ่านมา

    great explanation !

    • @topgate4u
      @topgate4u 8 วันที่ผ่านมา

      Thanks! Glad you liked it.

  • @nisshanthvell3645
    @nisshanthvell3645 22 วันที่ผ่านมา

    Sir is this blank method

    • @topgate4u
      @topgate4u 21 วันที่ผ่านมา

      Yes!

  • @warf1ghter
    @warf1ghter 25 วันที่ผ่านมา

    Thank you so much!

  • @milanrai3607
    @milanrai3607 หลายเดือนก่อน

    Can you design a Turing machine for L ={0^n1^m1^n0^m :m≥1,n>m} ?

  • @lohitharavikumar
    @lohitharavikumar หลายเดือนก่อน

    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 หลายเดือนก่อน

      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 หลายเดือนก่อน

    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 หลายเดือนก่อน

      Thank you so much for your appreciation!

  • @tri_suyash.
    @tri_suyash. หลายเดือนก่อน

    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'

    • @tri_suyash.
      @tri_suyash. หลายเดือนก่อน

      please solve this

  • @samueltcv3350
    @samueltcv3350 2 หลายเดือนก่อน

    the best

  • @sandeepmandrawadkar9133
    @sandeepmandrawadkar9133 2 หลายเดือนก่อน

    Excellent explanation 👌

    • @topgate4u
      @topgate4u หลายเดือนก่อน

      Glad you liked it

  • @aryanpatil49
    @aryanpatil49 2 หลายเดือนก่อน

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

  • @hardikmakwana4266
    @hardikmakwana4266 3 หลายเดือนก่อน

    tq sir

  • @parkhibhandula5664
    @parkhibhandula5664 3 หลายเดือนก่อน

    Thanks you explained it really well 😊

  • @devilonstudio7587
    @devilonstudio7587 4 หลายเดือนก่อน

    Well done

  • @suhailtheory
    @suhailtheory 4 หลายเดือนก่อน

    good

  • @ApparentlyIamAaditya
    @ApparentlyIamAaditya 4 หลายเดือนก่อน

    thx a lot

  • @muhammadfaiz28
    @muhammadfaiz28 5 หลายเดือนก่อน

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

    • @topgate4u
      @topgate4u 5 หลายเดือนก่อน

      Truely delighted to hear that!!!!

  • @MuhammadRizky-xu7bj
    @MuhammadRizky-xu7bj 5 หลายเดือนก่อน

    very amazing, i am student from indonesia

    • @topgate4u
      @topgate4u 5 หลายเดือนก่อน

      Glad it helped you!

  • @mohanawasthi7045
    @mohanawasthi7045 5 หลายเดือนก่อน

    thanks sir

    • @topgate4u
      @topgate4u 5 หลายเดือนก่อน

      Most Welcome! Best of luck for your preperations!

  • @infinity8982
    @infinity8982 6 หลายเดือนก่อน

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

    • @topgate4u
      @topgate4u 6 หลายเดือนก่อน

      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 6 หลายเดือนก่อน

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

    • @topgate4u
      @topgate4u 5 หลายเดือนก่อน

      Glad it was helpful!

  • @Project_coccon
    @Project_coccon 6 หลายเดือนก่อน

    Thank u sir

  • @sakthi_chesz
    @sakthi_chesz 7 หลายเดือนก่อน

    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 7 หลายเดือนก่อน

      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. 7 หลายเดือนก่อน

    thanks topG

  • @emnasellami4490
    @emnasellami4490 7 หลายเดือนก่อน

    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 7 หลายเดือนก่อน

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

  • @mahikabhardwaj8915
    @mahikabhardwaj8915 7 หลายเดือนก่อน

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

  • @maysam7083
    @maysam7083 7 หลายเดือนก่อน

    thank you so much

    • @topgate4u
      @topgate4u 7 หลายเดือนก่อน

      You're welcome!

  • @lisandronascimento
    @lisandronascimento 7 หลายเดือนก่อน

    Marvelous!

    • @topgate4u
      @topgate4u 7 หลายเดือนก่อน

      Glad you liked it!

    • @lisandronascimento1855
      @lisandronascimento1855 7 หลายเดือนก่อน

      Please, keep up the good work!

  • @harigona3405
    @harigona3405 7 หลายเดือนก่อน

    Sir You best of alll. Unsung Hero.

    • @topgate4u
      @topgate4u 7 หลายเดือนก่อน

      Glad you liked it!

  • @chintalagreeshma4664
    @chintalagreeshma4664 7 หลายเดือนก่อน

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

    • @topgate4u
      @topgate4u 7 หลายเดือนก่อน

      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 7 หลายเดือนก่อน

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

    • @topgate4u
      @topgate4u 7 หลายเดือนก่อน

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

    • @chintalagreeshma4664
      @chintalagreeshma4664 7 หลายเดือนก่อน

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

  • @Gamer516yt
    @Gamer516yt 7 หลายเดือนก่อน

    make the q4 as final state sir

    • @topgate4u
      @topgate4u 7 หลายเดือนก่อน

      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 8 หลายเดือนก่อน

    Sir when we have to change the state in PDA ?

    • @topgate4u
      @topgate4u 7 หลายเดือนก่อน

      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 8 หลายเดือนก่อน

    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 8 หลายเดือนก่อน

      I will soon make the videos on Grammars...

  • @vamsivelagada
    @vamsivelagada 8 หลายเดือนก่อน

    Great explanation sir... Beginner friendly tutorial..

    • @topgate4u
      @topgate4u 7 หลายเดือนก่อน

      Thanks and welcome

  • @swapnilvalvekar8779
    @swapnilvalvekar8779 8 หลายเดือนก่อน

    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 8 หลายเดือนก่อน

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

    • @swapnilvalvekar8779
      @swapnilvalvekar8779 8 หลายเดือนก่อน

      @@topgate4u ok sir thank you

  • @zahraali2858
    @zahraali2858 8 หลายเดือนก่อน

    Thank you so much, this has really helped me

    • @topgate4u
      @topgate4u 7 หลายเดือนก่อน

      Glad it helped!

  • @lazzy5173
    @lazzy5173 8 หลายเดือนก่อน

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

  • @YasarAmeen-h3i
    @YasarAmeen-h3i 9 หลายเดือนก่อน

    ek he baar may samaj aagaya tq

  • @abdelrahmanashraf2992
    @abdelrahmanashraf2992 9 หลายเดือนก่อน

    very well explained!

  • @TheShadod
    @TheShadod 9 หลายเดือนก่อน

    Great cand clear explanation, thank you so much

  • @TunerXMusic4u
    @TunerXMusic4u 10 หลายเดือนก่อน

    Thanks❤❤

  • @ozcankucuk9008
    @ozcankucuk9008 10 หลายเดือนก่อน

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

  • @shivaboinofficial8784
    @shivaboinofficial8784 11 หลายเดือนก่อน

    Worth sir ..

  • @astergaming2261
    @astergaming2261 ปีที่แล้ว

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

    • @topgate4u
      @topgate4u ปีที่แล้ว

      All the best

  • @astergaming2261
    @astergaming2261 ปีที่แล้ว

    just wow

  • @RehanaFasih-w8b
    @RehanaFasih-w8b ปีที่แล้ว

    Very informative lecture

  • @ShabbirAhmad-h3s1c
    @ShabbirAhmad-h3s1c ปีที่แล้ว

    Very good explanation

  • @ashisharunchaudhary7937
    @ashisharunchaudhary7937 ปีที่แล้ว

    Nice...