A NEW CHARACTERIZATION OF NONDETERMINIST1CALLY RECOGNIZABLE FAMILIES OF LANGUAGES
Citation：
Wang Chuan hong.A NEW CHARACTERIZATION OF NONDETERMINIST1CALLY RECOGNIZABLE FAMILIES OF LANGUAGES[J].Chinese Annals of Mathematics B,1991,12(1):1~12
Page view： 823Net amount： 605
Authors：
Wang Chuan hong;
Foundation：
This work was supported in part by Beijing-Hong Kong Academic Exchange Centre.
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.
