link Source: www.coursera.org
list 6 sequences
assignment Level : Introductory
chat_bubble_outline Language : English
card_giftcard 384 points
Users' reviews
-
starstarstarstarstar
0 reviews

Key Information

credit_card Free access
verified_user Free certificate
timer 48 hours in total

About the content

This course covers finite automata, context-free grammars, Turing machines, undecidable problems, and intractable problems (NP-completeness).

more_horiz Read more
more_horiz Read less
dns

Syllabus

Week 1: Finite Automata
Week 2: Regular Expressions and Properties of Regular Languages
Week 3: Context-Free Grammars and Languages
Week 4: Properties of Context-Free Languages, plus introduction to Turing Machines
Week 5: Turing Machines and Undecidability
Week 6: Intractable Problems (NP-Completeness)
record_voice_over
store

Content Designer

Stanford University

Leland Stanford Junior University, better known as Stanford University, is a private American university located in Silicon Valley, south of San Francisco.

Its motto is "Die Luft der Freiheit weht", which means "The wind of freedom blows".

Ranked among the world's top universities in most international rankings, it enjoys great prestige.

assistant

Platform

Coursera

Coursera is a digital company offering massive open online course founded by computer teachers Andrew Ng and Daphne Koller Stanford University, located in Mountain View, California. 

Coursera works with top universities and organizations to make some of their courses available online, and offers courses in many subjects, including: physics, engineering, humanities, medicine, biology, social sciences, mathematics, business, computer science, digital marketing, data science, and other subjects.

You are the designer of this MOOC?
What is your opinion on this resource ?
Content
5/5
Platform
5/5
Animation
5/5