A NEW CHARACTERIZATION OF NONDETERMINIST1CALLY RECOGNIZABLE FAMILIES OF LANGUAGES |
| |
Authors: | Wang Chuan hong |
| |
Institution: | Institute of Mathematics, Nankai University, Nankai, Tianjin. China. |
| |
Abstract: | 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. |
| |
Keywords: | |
|
| 点击此处可从《数学年刊B辑(英文版)》浏览原始摘要信息 |
| 点击此处可从《数学年刊B辑(英文版)》下载免费的PDF全文 |