哈工大2022形式语言与自动机期末试题

具体表述的单词记不太清了，不过大体意思是这样的。

每题10分

1、Design a DFA contains both 01 and 10 as substrings.

2、Design a NFA which has equal numbers of substrings 01 and 10.

3、Design Regular Expression on {a,b}.

        (1) which has two aa's as substrings. (UP注：aaa可以视为两个aa)

        (2) which not end with aa or bb.

4、Prove with pumping lemma: {w|w has equal number of 00 and 11} is not regular language.

5、Consider a homomorphism  h(a)=aa, and a DFA which accept the language L on . Design a DFA which accept h(L).

6、Design a Content-Free Grammar which can describe the CFL {w|w has just two noempty 0's blocks which has equal length}. (UP注：考试时老师改题将just去掉了，即只要有相等长度的0的块(run)即可)

7、Design a deterministic PDA which accept .

8、Consider the CFG:

        S->SAS|AA|ε

        A->00|ε

        (1) Eliminate ε-transition.

        (2) Eliminate unit-production in the result grammar.

        (3) Transfer the grammar to Chomsky Normal Form.

9、The follwing four transitions is a PDA, which starting state is q,empty stack symbol is Z. Convert the PDA to a CFG.

        (1) δ(q,0,Z) = {(q,X)}

        (2) δ(q,0,X) = {(q,XX)}

        (3) δ(q,1,X) = {(r,X)}

        (4) δ(r,0,X) = {(r,ε)}

10、Design a Turing Machine accept the language .