期刊文献+

A NEW CHARACTERIZATION OF NONDETERMINISTICALLY RECOGNIZABLE FAMILIES OF LANGUAGES^(**)

A NEW CHARACTERIZATION OF NONDETERMINISTICALLY RECOGNIZABLE FAMILIES OF LANGUAGES^(**)
原文传递
导出
摘要 In this paper,the author establishes the concepts of relative self-compatibility andrelative finite derivability of languages and obtains the relation between self-compatibilityand relative self-compatibility.From this it is proved that a family of languages isnondeterministically recognizable if and only if it is relatively self-compatible andrelatively finitely derivable to some set of families of langugaes. In this paper,the author establishes the concepts of relative self-compatibility and relative finite derivability of languages and obtains the relation between self-compatibility and relative self-compatibility.From this it is proved that a family of languages is nondeterministically recognizable if and only if it is relatively self-compatible and relatively finitely derivable to some set of families of langugaes.
作者 王传洪
出处 《Chinese Annals of Mathematics,Series B》 SCIE CSCD 1991年第1期1-12,共12页 数学年刊(B辑英文版)
基金 This work was supported in part by Beijing-Hong Kong Academic Exchange Centre.
  • 相关文献

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部