论文信息 - Fuzzy grammars and recursively enumerable fuzzy languages

Fuzzy grammars and recursively enumerable fuzzy languages

Abstract One proves that a fuzzy language is generated by a fuzzy grammar if and only if it is recursively enumerable (that is its set of fuzzy points is recursively enumerable). As an immediate consequence, one gives simple proofs that the union, the intersection, the concatenation of two generated fuzzy languages is a generated fuzzy language.

Giangiacomo Gerla | Giangiacomo Gerla

[1] Giangiacomo Gerla. Sharpness relation and decidable fuzzy sets , 1982 .

[2] Giangiacomo Gerla,et al. TuringL-machines and recursive computability forL-maps , 1989, Stud Logica.

[3] J. Goguen. L-fuzzy sets , 1967 .

[4] Giangiacomo Gerla,et al. Recursively Enumerable L-Sets , 1987, Math. Log. Q..

[5] Eugene S. Santos. Fuzzy and probabilistic programs , 1976 .

[6] Siegfried Gottwald,et al. Applications of Fuzzy Sets to Systems Analysis , 1975 .

[7] Leon Harkleroad. Fuzzy Recursion, RET's, and Isols , 1984, Math. Log. Q..

[8] Lotfi A. Zadeh,et al. Note on fuzzy languages , 1969, Inf. Sci..

[9] Giangiacomo Gerla,et al. Decidability, partial decidability and sharpness relation for L-subsets , 1987, Stud Logica.

[10] Jr. Hartley Rogers. Theory of Recursive Functions and Effective Computability , 1969 .