For those who haven't gone through the lecture....I would say it is the best way this subject can be taught and he explains it very clearly. Not for those who have exam tomorrow.

thank you so much for sharing this course, I'm living in a country where buying things from other countries like online courses isn't possible due to sanctions. these free courses are the only things that let me learn, thank you again for your awesome website and courses.

so this is that Michael Sipser whose book we all read and love

This is THE Michael Sipser of Sipser's Introduction to the Theory of Computation.

Holy shit! The legendary Michael Sipser is teaching it in video!!!!

I've been waiting for this ever since I looked at Sipser's page and saw that it was being reviewed for OCW!

thank you MIT OCW for sharing such wonderful knowledge with detail explanation, for those who are not able to get source to learn things, it is really very great and awesome platform. thank you!

for those who want to know Mike Sipser is author of the book that in detail explains those fundamentals of computer science, make sure you watch these playlist they have a huge value for those who want to learn theory of computation.

Beautiful lecture, professor. I really appreciate this contribution.

personal index: def of finite automaton : 20:00 regular lang def : 29:00

Thanks to all for making this possible.

Amazing lecture, everything clear even though it's mathematical, thanks for sharing

that is greatness - shows a different level of clarity....

It's always a pleasure listening to lecture of a Legend.

Woah, it's so cool to see him teaching here 😮

Just got automata and regular languages at school for computer science. Surprise surpise, i didn't understand a thing. Thank god for this youtube video.

Love OCW. Figured they would have something for this to self study

Very helpful to future students! Great work! Thank you!

Great thanks Mit OCW, the textbook is also great

31:59 Basically, the reason why you can solve this problem, you can make a finite automaton which recognizes the language B, is because that finite automaton is going to keep track of the parity of the number of 1's it's seen before. This has two states, one of them remembering that it's seen an odd number of 1's so far, the other one remembering it's seen an even number of 1's before. And that's going to be typical for these automata, finite automata. There's going to be several different possibilities that you may have to keep track of as you're reading the input, and there's going to be a state associated with each one of those possibilities. So if you're designing an automaton, you have to think about-- as you're processing the input-- what things you have to keep track of. And you're going to make a state for each one of those possibilities 41:52 Show finite automata equivalent to Regular Expression.

One of the silver linings for covid. Thanks.

i am waiting this course for long time☺️☺️☺️ i am very happy

i love you MIT opencourseware

work begins at 9:12

dang just got his book introduction to computation and now i m watching his videos :) amazing video :)

thanks for sharing

as someone who has used his text on toc, this is fun to watch. i wonder how i missed this playlist earlier.

Thank you professor

Thank you.

I really wish my Formal Languages/Theory of Computation (whichever your university calls the course), professor made it easier to understand like how Dr. Sipser does! Ty so much! Because I have my final this week and Dr. Sipser, as the author of my Theory of Computation course-textbook, and now I actually understand as I review for my final! ^^

is F (which is the set of accept states) the same as saying the set of all final states? @21:54

Thank you

TOC: Basic TOC concepts: FA, Definition, Regular languages & their properties

watched vid to try and see what course was about since course description was bit unclear to me. reminds me of linear algebra a bit but still unclear as to the materials utility. Anyone have more complete understanding of subject that could tell me about where the information is useful?

Thanks sir!

Thank you very much

Input letters are a and b, then what is the regular expressions no two a's come together (string may be any length) can anyone plz help plz!!!!!!!

A Sipser MIT course. :-) :-) :-)

where was this back last semester >.< this was my subject.

very helpful, thanks!

Why, thank you, Sir!

Is this Mr. Sipser himself? It's been some years that I read his book. Had a love-hate relationship with that subject lol.

41:00 I was thinking this is like RegEx and then I was like hey this IS RegEx .. Fun to learn TOC at a random point in my education

Now I have something to watch on the bus

the S = (a, b) Is the (a* + b*) equals with (a + b)* or (ab)* with (a*b*) ?? Pls help me (sorry for my bad english)

Department of Computer Engineering & Informatics University of Patras, Hellas. Thank you, it was really helpful!

The slides are so easy on the eyes.

Bookmark: 28:00

Is (1U0)* actually supposed to be {{1}U{0}}* ? I might be wrong but we defined the union operation on languages which are sets. 1 and 0 do not appear to be set. This is min 40. Thanks in advance.

Thanks

Great course! Thanks a lot!

What is good homework to test if we clearly understand this lecture? Is there such corresponding homework?

Not sure if the professor will alter his opening statement on math and AI, it looks like Q*2 has broken ground on that. Shows how 1 year ago is an eon in CS

can I think of the definition at 25:54 as exact match regarding regular expression?

Boring friday night? mit course sounds like a good plan. XD

Great!

can someone please let me know of the prerequisites before starting if you have already seen the course.

16:35 To be honest, you did wake me up

At 31:20 , I don't think that automaton can be created with two states. If it is possible, please share answer.

Professor, Can we consider that Σ*1 is equal to Σ^1

At 23:39 why q2 goes to q1 if the input is zero, why not it has circle above it like q1.

Thank you heard my request

I would have failed this class if it wasn't for these lectures

Done ✅

04:30 prerequisites

6:15 COMO FUNCIONA EL CEREBRO HUMANO ....

我是中国人 很感谢🙏

where are the ppts?

where can i access the slides?

No one talks about computability of computer with proper example.

Where can I get the slides used in the video?

i have exam this day, im reviewing today HAHAHA.

isn't there a free legal version for the book

huge thanks from hungary!!

❤️ ❤️ ❤️

Here, before GATE 2022

Construct NDPDA for the language of all non-palindrome. Construct DPDA for the language of all those strings in which the no. of a’s twice the no. of b’s. anybody help me please

💡

0:09

1:00:24 Loudly crying face (copyrighted) Source Unknown

28:18

2:22

1 done

32:00

Goood

Master in engineering here🇺🇸🇺🇸🇺🇸

34:32

Take a drink everytime he AUMM

10:08

저자직강

37:03 No BADBADNOTGOOD ?? lol

It is so hard to keep track of what he is explaining in the last 3 sections. Lost interest...

I'm a math major, and my uni only offers theoretical CS as a unit to CS majors (or you'd have to do enough to earn a CS minor at least), which sucks because this really interests me, but I don't care much for the engineering/code-monkey stuff. Thanks for uploading this, I'm gonna follow these closely for sure!

Can be explained by lambda calculus, much more concise and graceful

I did not understand 70% of the class

7:00 WHy you want that computers should do what a human brain can do. WHY WHY WHY? ? humans are aready very huge in no. there is no shortage of them.

Only basic. No depth.