# 计算机作业代写√编程作业代写√成绩包Pass√

### 计算理论的重要性

• 编写在计算设备中运行的高效算法。
• 编程语言研究及其发展。
• 高效的编译器设计和构造。

1. 自动机理论。
2. 可计算性理论。
3. 复杂性理论。

### 复杂性理论

Q1：Consider context-free grammar, which of the following statements are true?

The following checkbox options contain math elements, so you may need to read them in your screen reader’s “reading” or “browse” mode instead of “forms” or “focus” mode.

Choice 1 of 7:The left-hand side of a substitution rule can contain terminals.

Choice 2 of 7:There is exactly 1 start variable.

Choice 3 of 7:The language generated by a grammar contains variables.

Choice 4 of 7:A sequence of substitutions, subject to the rules of the grammar, is called a derivation.

Choice 5 of 7:The set of variable and terminals are disjoint.

Choice 6 of 7:A rule of the form R \rightarrow \epsilonRϵ is a valid rule where RR is the start variable. Choice 7 of 7:Every context-free.

Choice 7 of 7:Every context-free grammar generates a language that is recognised by a non-deterministic finite state machine.

Chomsky normal form (CNF) is a normal form for context-free grammars. Select all of the following statements that are true.

The following checkbox options contain math elements, so you may need to read them in your screen reader’s “reading” or “browse” mode instead of “forms” or “focus” mode.

Choice 1 of 5:For every regular language there exists a context-free grammar in CNF that generates the language.

Choice 2 of 5:Every context-free grammar is in CNF

Choice 3 of 5:A rule of the form R \rightarrow aBRaB is a valid rule in CNF.

Choice 4 of 5:Every grammar expressed in CNF is unambiguous.

Choice 5 of 5:For every context-free grammar GG there exists a grammar HH in CNF such that L(G) = L(H)L(G)=L(H).

## Recent Case

### 盘点留学生常用5 种最佳笔记方法，哪一种适合您

SCI期刊论文的发表过程是一项复杂而细致的工作，涉

### 轻松掌握万能Essay模板，撰写一篇合格的英文论文

Python可谓是当下最火的编程语言，同时，Pyt