Introduction to Theory of Computation

preview_player
Показать описание
An introduction to the subject of Theory of Computation and Automata Theory.
Topics discussed:
1. What is Theory of Computation?
2. What is the main concept behind the subject Theory of Computation?
3. Some simple examples explaining the scope of TOC.
4. A brief overview of the topics in Theory of Computation.

Music:
Axol x Alex Skrindo - You [NCS Release]

#TheoryOfComputation #TOCByNeso #AutomataTheory
Рекомендации по теме
Комментарии
Автор

I HAVE STARTED WATCHING YOUR VIDEOS 3 DAYS BEFORE MY AUTOMATA EXAM. THE KNOWLEDGE WHICH YOU HAVE GIVEN ME IN 3 DAYS MY PROFESSOR FAILED TO DELIVER IN AN ENTIRE SEMESTER. I HAVE SCORED REALLY GOOD JUST BECAUSE OF YOU. ME AND MY FRIENDS ARE INDEFINITELY IN DEBT TO YOU. YOU DESERVE ALL THE HAPPINESS IN THIS WORLD MAY GOD GIVE YOU EVERYTHING. THANK YOU SO MUCH🛐🙏😭

harsha_m
Автор

Happiness is Searching course on Automata Theory and then got course from Neso Academy.
Thank you sir.

amitprajapati
Автор

In 2016, I failed in TOAC in 5 semester . I got only 12 marks. This was a boring subject for me. I unable to learned from my teacher. Next year in 2017, one of my friends told me about Neso Acadmy TOAC lecture. I downloaded all lecture and started studying daily 2, 3 videos. I feel loving this series And interest in TOAC. In 7 semester watched and learned all concept by watching all videos 2 times all series . I reappear in exam and got 76 marks out 0f 100 💯 . Highest in college. Really Thanks dilse ❤.

rahulkushwaha
Автор

I just wanted to say thank you Neso Academy for making this playlist. I got my final grade back (passed!) in my Automata/TOC course and could not have done it without watching all videos on this playlist. You all helped me so much for the midterm and final!

brendaro
Автор

No of videos in TOC : 114
Average length of video : 10 minutes, 25 seconds
Total length of playlist : 19 hours, 49 minutes, 9 seconds
At 1.25x : 15 hours, 51 minutes, 19 seconds
At 1.50x : 13 hours, 12 minutes, 46 seconds
At 1.75x : 11 hours, 19 minutes, 30 seconds
At 2.00x : 9 hours, 54 minutes, 34 seconds
Have Fun Learning !

kevinmitnick
Автор

Not me learning more just 5 minutes into this video than I have from my professor after a month of classes! You are a king!

zachriaul
Автор

i have exam in 16 days and didn't even study any subject, i searched for automata first and saw this playlist really i am in love with his teaching

gurukirans
Автор

Best Tutorials for Formal language and Automata theory. These videos come in handy before the final exam. Thanks to the channel.

HemanthKumar-fvpi
Автор

Your Theory Of Computation videos have been a great help on understanding the new concepts!
Thank you Neso Academy :)

NotFlame
Автор

No of videos : 114
Average length of video : 10 minutes, 25 seconds
Total length of playlist : 19 hours, 49 minutes, 9 seconds
At 1.25x : 15 hours, 51 minutes, 19 seconds
At 1.50x : 13 hours, 12 minutes, 46 seconds
At 1.75x : 11 hours, 19 minutes, 30 seconds
At 2.00x : 9 hours, 54 minutes, 34 seconds

gatesorted
Автор

Your channel had a huge part in helping me with Digital Electronics last year, So glad to find, that you've also covered TOC even before I had a chance to attend my first Lecture in college!

husainshaikh
Автор

Day 1 of this semester I'm not neglecting my studies ever again .

lemon-zmrq
Автор

A HUGE THANK YOU TO NESO ACADEMY WITH ALL YOUR LECTUTE VIDEOS I HAVE ATTEMPTED 60 MARKS IN SEMISTER CONFIDENTLY!
thankyou from my bottom of my heart!

satish
Автор

I started as my class starts. I think this is the good way if someone really wants to learn .❤

continnum_radhe-radhe
Автор

Thank you very much for teaching me and helping through my semester. Good job 😁😁😁

vikneshpathmarajah
Автор

Neso academi was the one on which I relied for DLD. Now it's going to help us for TOC.
Awesome.
Glad that I found your playlist for TOC

prateekdubey
Автор

⚪️ *Finite State Machine (FSM)* - This is the simplest model of computation.
⚪️ *Context Free Language (CFL)* - It's a little more powerful than FSM and it doesn't refer to a programming language, it's just a set of strings.
⚪️ *Turing Machine* - Much more powerful than CFL and FSM.
⚪️ *Undecidable* - These are the problems that cannot be solved mechanically.

bezbos
Автор

Coz of u I pass my TOC exam thnk u so much plzz make video in compiler designer

PoojaDas
Автор

i just love and respect for this academy

sarikahp
Автор

Thank you Neal Academy for making this wonderful series. Really it wouldn't have been possible to pass the TOC exam without you.

This quality of education is not even imparted in paid courses sometimes.

Great job!!

rachitchhabra