ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
Information Sciences
Volume 60, Issues 1-2, March 1992, Pages 137-143
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Purchase PDF (485 K)

Article Toolbox
 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/0020-0255(92)90008-V    
How to Cite or Link Using DOI (Opens New Window)

Copyright © 1992 Published by Elsevier Science Inc.

Fuzzy grammars and recursively enumerable fuzzy languages

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Giangiacomo Gerla

Dipartimento di Matematica ed Applicazioni “Renato Caccioppoli”, Via Mezzocannone 8, 80134, Napoli, Italy


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.

Article Outline

• References

Information Sciences
Volume 60, Issues 1-2, March 1992, Pages 137-143
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.