简体繁体 English

递归语言的属性

[英]Properties of recursive languages

原文 2013-06-18 18:06:19 9 1 recursion/ properties/ enumerable

Can anybody please help me with these questions? 有人可以帮我解决这些问题吗？

Which properties of the following recursive languages are recursively enumerable? 下列递归语言的哪些属性可以递归枚举？

L_1 = { L | L_1 = {L | L is regular} L是常规的}

L_2 = { L | L_2 = {L | L contains < A > for some A,which holds on sequence 000111000} L包含一些A的<A>，其保留于序列000111000}

L_3 = { L | L_3 = {L | L contains < A > for some A, which holds on epsilon } L对于包含在epsilon上的A包含<A>

1 个解决方案

Recursive languages (also known as Decidable languages) are the languages for which there exists a turing machine which accepts the language and halts on both both accepting and non-accepting words. 递归语言（也称为可确定语言）是存在图灵机的语言，该图灵机接受该语言并在接受和不接受的单词上都停止。

Recursive enumerable languages are languages for which there exists a turing machine which halts on accepting strings. 递归可枚举语言是存在一种图灵机的语言，该图灵机会停止接受字符串。

So set of Recursive languages is a subset of set of Recursively enumerable languages. 因此，递归语言集是递归可枚举语言集的子集。

So, if I understood the question right, then L_1, L_2 and L_3 are recursively enumerable. 因此，如果我理解正确的问题，则L_1，L_2和L_3可以递归枚举。