link
来源：www.coursera.org
list
6个序列
assignment
等级：入门
chat_bubble_outline
语言：英语
card_giftcard
384分
评论
关键信息
credit_card
免费进入
verified_user
免费证书
timer
48小时总数
关于内容
This course covers finite automata, context-free grammars, Turing machines, undecidable problems, and intractable problems (NP-completeness).
more_horiz
查看更多
more_horiz
收起
dns
课程大纲
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
教师
- Jeff Ullman
store
内容设计师
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
平台
Coursera是一家数字公司，提供由位于加利福尼亚州山景城的计算机教师Andrew Ng和达芙妮科勒斯坦福大学创建的大型开放式在线课程。
Coursera与顶尖大学和组织合作，在线提供一些课程，并提供许多科目的课程，包括：物理，工程，人文，医学，生物学，社会科学，数学，商业，计算机科学，数字营销，数据科学 和其他科目。
您是 MOOC 的设计者？
keyboard_arrow_left
grade
keyboard_arrow_right
整合评论系统
