Copyright © 1992 Published by Elsevier Science Inc.
Fuzzy grammars and recursively enumerable fuzzy languages
Received 6 November 1988;
revised 30 June 1989.
Available online 20 May 2003.
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.






E-mail Article
Add to my Quick Links

Cited By in Scopus (6)

* grammars,
grammars, 



