论文信息 - Finite 𝕃-Fuzzy Acceptors, Regular 𝕃-Fuzzy Grammars And Syntactic Pattern Recognition - 字舞流文

Finite 𝕃-Fuzzy Acceptors, Regular 𝕃-Fuzzy Grammars And Syntactic Pattern Recognition

–fuzzy acceptors in relationship with formal –fuzzy languages and –fuzzy grammars are studied, where is a bounded chain. Applications of fuzzy linguistic methods in syntactic pattern recognition are described.

Ketty Peeva | K. Peeva

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

[2] Eugene S. Santos,et al. Context-Free Fuzzy Languages , 1974, Inf. Control..

[3] Ketty Peeva,et al. Fuzzy acceptors for syntactic pattern recognition , 1991, Int. J. Approx. Reason..

[4] Seok Yoon Hwang,et al. General fuzzy acceptors for syntactic pattern recognition , 1996, Fuzzy Sets Syst..

[5] Eugene S. Santos. Fuzzy automata and languages , 1976, Information Sciences.

[6] Jun'ichi Toyoda,et al. L-fuzzy grammars , 1975, Inf. Sci..

[7] Peter R. J. Asveld,et al. A Bibliography on Fuzzy Automata, Grammars and Lanuages , 1995 .

[8] Jun'ichi Toyoda,et al. N-fold fuzzy grammars , 1973, Inf. Sci..

[9] T. Pavlidis,et al. Fuzzy sets and their applications to cognitive and decision processes , 1977 .

[10] Michael G. Thomason,et al. Finite fuzzy automata, regular fuzzy languages, and pattern recognition , 1973, Pattern Recognit..

[11] Namio Honda,et al. RECOGNITION OF FUZZY LANGUAGES , 1975 .

[12] Giangiacomo Gerla,et al. Fuzzy grammars and recursively enumerable fuzzy languages , 1992, Inf. Sci..

[13] Eugene S. Santos,et al. Max-product grammars and languages , 1975, Inf. Sci..

[14] Moti Schneider,et al. The recognition of imperfect strings generated by fuzzy context sensitive grammars , 1994 .