Top Free Classes

Class Calendar User forum Blog
Follow us to get notified about new classes

Help your friends find these classes

Sign up for free personalized recommendations. Sign up is free and easy.
Search for classes 



Jeffrey Ullman Stanford University @Coursera
Class Start: TBA
Duration: 6 weeks
Approximate Workload: 8-10 hours/week
Level: intermediate
Rate this class Go to the class
This course covers finite automata, context-free grammars, Turing machines, undecidable problems, and intractable problems (NP-completeness).
Categories: [Computer Science]

Click here to review this class

Anonymous (Singapore, Singapore) , 2013-12-15
As the other reviewer stated, the lectures are too long , and the concepts advanced is a very rapid fashion.
However i would say , i don't have a computer science or maths background. It was useful for quality information on automata

Please log in to vote or edit

Anonymous (Singapore, Singapore) , 2012-12-30
This course covers following topics : finite automata (deterministic, non-deterministic), regular expressions, context-free grammars and languages, Turing machines, decidability, and P and NP problems. The course closely follows the book “Introduction to Automata Theory, Languages, and Computation” by John Hopcroft, Rajeev Motwani and Jeffrey Ullman. I found the book more interesting than video lectures that , in my opinion, were too long and sometimes boring. Last two weeks, again, in my opinion, were rushed and I didn't really understand P and NP problems. That said, I'm glad I took this course and satisfied my interest in regular languages and context-free grammars.

Please log in to vote or edit

Similar classes
Introduction to Theoretical Computer Science
Sebastian Wernicke
Start date: always available

© 2012-2016, TFC Online LLC | Home | Terms of Use and Privacy Policy | About Us