ALGORITHMS FOR FINDING CHOMSKY AND GREIBACH NORMAL FORMS FOR A FUZZY CONTEXT‐FREE GRAMMAR USING AN ALGEBRAIC APPROACH
EDWARD T. LEE
(Department of Mathematical Sciences, Memphis State University, Memphis, Tennessee 38152 (USA))
52
Abstract
Algorithms for the construction of the Chomsky and Greibach normal forms for a fuzzy context‐free grammar using the algebraic approach are presented and illustrated by examples. The results obtained in this paper may have useful applications in fuzzy languages, pattern recognition, information storage and retrieval, artificial intelligence, database and pictorial information systems.
Citation
LEE, E.T. (1983), "ALGORITHMS FOR FINDING CHOMSKY AND GREIBACH NORMAL FORMS FOR A FUZZY CONTEXT‐FREE GRAMMAR USING AN ALGEBRAIC APPROACH", Kybernetes, Vol. 12 No. 2, pp. 125-134. https://doi.org/10.1108/eb005648
Publisher
:MCB UP Ltd
Copyright © 1983, MCB UP Limited