A Course on Automata Theory

https://www.coursera.org/course/automata

by brudgers • 11 years ago

198 30 11 years ago

schoen2• 11 years ago

I took this on Coursera a couple of years ago and it was the automata theory class I never managed to take in college but always wanted to.

As you might expect from a course by Ullman, it's heavy on theory and detail.

People are right to say that this is a core topic in computer science, and I'd recommend it to people who like CS conceptually and are curious about the parts beyond programming. Automata come up everywhere!

volkadav• 11 years ago

Agreed; I took this the first time around and had a great time. Highly recommended! :)

For what it's worth, Sipser's _Introduction to the Theory of Computation_ helped me get through some of the gnarlier spots (and in turn, the lectures through some of the harder parts of the book). I picked up a used copy of the 2nd edition cheap off Amazon (it was sub-$20 iirc).

data_spy• 11 years ago

I'm probably going to check this out. I've taken several Coursera courses in the past and they've been great.

hyperpallium• 11 years ago

Do you have to use your full name to enroll, in the field asking for it? I've probably become excessively paranoid about giving personal info on the web - Stanford is probably OK...

jules• 11 years ago

The signup form has a field named Full Name, but what's stopping you from using a pseudonym?

schoen2• 11 years ago

Coursera is trying to branch out into academic partnerships and professional credentialing, which will probably want your legal name if they become relevant to your use of Coursera. I don't think they have a way to confirm your name for a simple course enrollment.

mden• 11 years ago

Judging from my account, no you don't. Maybe if you are planning on being certified but just to take a course, no.

makoz• 11 years ago

Only really matters for certificate.

gnuvince2• 11 years ago

When I was an undergrad at Université de Montréal, the theory of computation class which dealt with automata was called "Informatique Théorique"; literally, "theoretical computer science". "Why do theoretical computer science," I'd ask, "let's do practical computer science instead!" However, thanks to the enthusiasm of my professor and his teaching assistant and the very interesting nature of the subject, it became the class that I enjoyed the most of my whole undergrad! And to this day, some of the lessons I learned remain important in my day to day work for some of the reasons mentioned by prof Ullman in the video: I now know that some problems can't be solved, some take too long to solve, and some problems require less powerful mechanisms to solve. And knowing this, I'm able to recognize when they are applicable or at least have an intuition that maybe they could be applicable and thus I have a clearer idea of how to solve certain problems.

I highly encourage you to learn about this stuff, it's a lot of fun and is actually practical!

userbinator• 11 years ago

Regular expressions are probably one of the most practical and immediately obviously useful things to come out of automata theory.

jimhefferon2• 11 years ago

I'm interested to hear you say this. I teach this course, to students who mostly go on to do Java coding. I have several times run into an old student who told me that they never once used regexes after my class, either in school or in work.

forgettableuser• 11 years ago

I already knew Perl and Posix regex when I took automata. I cruised through the initial basics of regular expressions faster than my peers. But I got into trouble after I learned that regex contains a bunch of features (hacks) that have no grounding in pure automata theory. I had to unlearn a whole bunch of things.

dhawalhs• 11 years ago

A few user written reviews for those interested in the course: https://www.class-central.com/mooc/376/coursera-automata#rev...

dopeboy• 11 years ago

Out of all the theory I learned in school, learning a FSA in compilers class has probably been the most helpful. Whether I'm teaching kids 'if' statements for implementing a vending machine or sitting down with a client and trying to document their workflow, automata theory has been incredibly useful for me.

saurabhjha• 11 years ago

I am taking this course as it is a prerequisite to the subjects of compilers and computational complexity theory.

Has anyone used Sipser's text with this course? I found Sipser's textbook a great introduction to this field and thinking of complementing this course with the book.

Chetan496• 11 years ago

The book by Peter Linz for Theory of Computation (https://books.google.co.in/books/about/An_Introduction_to_Fo...) is also a good text.

WasimBhai• 11 years ago

I am an EE who has previously tried to take this course and found it incredibly hard because of theory, formal proofs etc.. Can anyone recommend a book, lecture notes to accompany this course to make life easy?

ArloJamesBarnes• 11 years ago

I am not sure what the course is like, so I am not sure if this would help, but Stephen Wolfram's book about automata is pretty good.

rifung• 11 years ago

This is the book that was used when I was an undergrad.

http://www.amazon.com/Introduction-Theory-Computation-Michae...

It is also used for the graduate course.

psk• 11 years ago

I've had a few similar courses at university, but they've always been limited to NP-completeness, does anyone know how I can expand on this? That is, learn beyond NP-completeness (Books / Online courses etc)?

grumpy-buffalo• 11 years ago

If you're interested in computational complexity theory, I recommend "Computational Complexity" by Christos Papadimitriou. It's a classic, though it's a bit dated.

groar• 11 years ago

For those who want to dive further in automata theory, transducers and the non-commutative algebraic view of the theory, the following one by J. Sakarovitch is a fantastic book : http://www.cambridge.org/uk/catalogue/catalogue.asp?isbn=978...

romaniv• 11 years ago

I was lucky to have an excellent professor for a similar course in college (it was called Computation Theory). It completely changed the way I think about programming. Specifically, it changed how I think about program state and software bugs. Also, knowing about finite state machines really helps with requirement analysis.

So, highly recommended.

A Course on Automata Theory

Related Stories