1) recursively enumerable set
递归可数集
2) recursive set functions
递归集函数
1.
In this paper, the notions of recursive functions and recursive formulas on sets are introduced; some properties of such functions and formulas are studied; and the relations between recursive set functions and primitively recursive set functions are defined by Jenson and Karp and between recursive set functions and recursive number theoretic functions are also discussed.
研究了递归集函数的初步性质，讨论了递归集函数与Ｊｅｎｓｅｎ和Ｋａｒｐ定义的原始递归集函数及递归数论函数之间的关系，并给出了ＺＦＣ的可定义集模型上递归集函数的范式定理。
3) recursively enumerable
递归可数的
4) recursively enumerable set
递归可列举集
5) recursively enumerable set
递归可枚举集
1.
The theorem that the language set distinguished deterministic finite automaton is a recursively enumerable set was proved,and then,the recursiveness of regular language was analyzed.
从正则语言识别的角度证明了正则语言的识别系统确定有限自动机所识别的语言集是一个递归可枚举集,同时讨论了正则语言的可递归性。
6) recursively enumerable sets/recursivelycontrolled Turing reducibility
递归可枚举集/递归控制Turing可化归性
补充资料：部分递归函数
部分递归函数
partial recursive function
部分递归函数【声而且recur幼ve五11℃ti.I;，acT“叹加pe鱿即e抓n曲中”Ku“.]，递归函数(recurslve func-tion) 可计算函数(computab卜丘mc如n)概念的等价精确化之一B E.取肛x。撰【补注】亦见部分递归算子(p盯hal化cursive Opera-tor);递归函数(reeursiVe fun etio灯).杜小杨译
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条