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

最新推荐文章于 2021-05-17 11:13:01 发布

강구연월

最新推荐文章于 2021-05-17 11:13:01 发布

阅读量9k

点赞数 33

文章标签：哈尔滨工业大学形式语言与自动机期末考试 2019年

本文链接：https://blog.youkuaiyun.com/GoodLuckWJP/article/details/94589939

版权

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

Design a DFA for the language L = {w∈{0,1}* | w contains both 01 and 10 as substrings}.
Design a NFA within four states for the language {a}*∪{ab}*.
Design regular expressions for language over Σ = {0,1}.
(1).All strings contain the substring 001.
(2).All strings expect the string 001.
Prove that L = {0^m1ⁿ | m/n is an integer} is not regular with pumping lemma.
Convert the following NFA into DFA with subset construction.
Give a context-free grammar for L = { aⁱb^jc^i+j|i,j>=0}
Let L be the language generated by the grammar G below
S->AB|BBB
A->Bb|ε
B->aB|A
(1).消除空产生式
(2).消除单元产生式
(3).转换到CNF
<