Context-Free Languages
来源:互联网 发布:软件架构设计师认证 编辑:程序博客网 时间:2024/06/05 03:22
2.1
Concepts: substitution rule (production),variable,terminal,derivation
Definition: a context-free grammar is a 4-tuple(variables, terminals, rules, start variable)
Chomsky normal form:
A ®B, C
A ® a
Theorem:
Any context free language is generated by a context-free grammar in Chomsky normal form.
2.2
A pushdown automaton is a 6-tuple (states, input alphabet, stack alphabet, transition function, start state, accept states)
Theorem
A language is context free if and only if some pushdown automaton recognizes it.
2.3
The pumping lemma for context-free languages
1.
2. |vy| > 0
3. |vxy| £ p
- Context-Free Languages
- Probabilistic Context-Free Grammar
- Languages
- POJ 2815 Context-Free Clock
- Sicily 1182. Context-Free Clock
- BNF 都是context free的语法
- POJ 2815 Context-Free Clock 笔记
- 语法分析(1)---上下文无关的文法(context-free grammars)
- NLP 学习笔记 03 (Probabilistic Context-Free Grammars (PCFGs))
- Regular Languages
- Programming Languages
- programming languages
- free.
- free
- free()
- free
- free
- free
- 在linux下设置开机自动启动程序的方法(一)
- 使用Ant打包Ear配置步骤说明
- plug-in for eclipse 3X
- 用Javascript实现Agent(网页精灵)(1)
- at blogcn :http://www.blogcn.com/User8/tojava/index.html
- Context-Free Languages
- The Church-Turing Thesis
- 谈软件的价值--读国内软件业陷入“三输”怪圈 正走向慢性自杀
- 理解XForm——学习IBM DW的资料 (3)
- Decidability
- 论家居、卧室(转自javaeye)
- 理解XForm——学习IBM DW的资料 (4)
- C#文本文件打印示例3
- 关于VIM的一些资料