哈尔滨工业大学2019年《形式语言与自动机》期末试题

哈尔滨工业大学2019年《形式语言与自动机》期末试题

1. Design a DFA for the language L = {w∈{0,1}* | w contains both 01 and 10 as substrings}.

2. Design a NFA within four states for the language {a}*∪{ab}*.

3. Design regular expressions for language over Σ = {0,1}.
   (1).All strings contain the substring 001.
   (2).All strings expect the string 001.

4. Prove that L = {0^m1ⁿ | m/n is an integer} is not regular with pumping lemma.

5. Convert the following NFA into DFA with subset construction.
   

6. Give a context-free grammar for L = { aⁱb^jc^i+j|i,j>=0}

7. Let L be the language generated by the grammar G below
   S->AB|BBB
   A->Bb|ε
   B->aB|A
   (1).消除空产生式
   (2).消除单元产生式
   (3).转换到CNF

   <