link
Source: www.coursera.org
list
6 sequences
assignment
Level : Introductory
chat_bubble_outline
Language : English
card_giftcard
384 points
Users' 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)
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
Instructors
- Jeff Ullman
store
Content Designer
The Leland Stanford Junior University, commonly referred to as Stanford University or Stanford, is an American private research university located in Stanford, California on an 8,180-acre (3,310 ha) campus near Palo Alto, California, United States.
assistant
Platform
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?
keyboard_arrow_left
grade
keyboard_arrow_right
Integrate the reviews system
