This course covers finite automata, context-free grammars, Turing machines, undecidable problems, and intractable problems (NP-completeness).
Thank you for checking out CourseBuffet. We are hard at work to make CourseBuffet your favourite place to find courses. If you would like to get in touch please drop a line at contact [at] coursebuffet.com
© 2018 CourseBuffet LLC, Some Rights Reserved