×

On time dependent fuzzy sets. (English) Zbl 0242.90057


MSC:

90C30 Nonlinear programming
68T10 Pattern recognition, speech recognition
03E70 Nonclassical and second-order set theories
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Bellman, R.; Kalaba, R.; Zadeh, L. A., J. Math. Anal. Appl., 13, 1 (1966)
[2] Bellman, R.; Zadeh, L. A., Decision-making in a fuzzy environment, Electronics Research Laboratory, (Report ERL-68-8 (1969), University of California: University of California New York) · Zbl 0224.90032
[3] Chang, C. L., J. Math. Anal. Appl., 24, 182 (1968)
[4] Dugundji, J., Topology (1966), Allyn and Bacon: Allyn and Bacon Berkeley · Zbl 0144.21501
[5] Goguen, J. A., J. Math. Anal. Appl., 18, 145 (1967)
[6] Kelley, J. L., General Topology (1955), Van Nostrand: Van Nostrand Boston · Zbl 0066.16604
[7] Nasu, M.; Honda, N., Information Control, 12, 284 (1968)
[8] Quade, E. S., (English, J. M., Cost-effectiveness (1968), Wiley: Wiley Princeton, N.J.)
[9] Zadeh, L. A., Information Control, 12, 94 (1968)
[10] L. A. Zadeh, Proc. Symp. System Theory; L. A. Zadeh, Proc. Symp. System Theory
[11] Zadeh, L. A., Information Control, 8, 338 (1965)
[12] Zadeh, L. A., J. Math. Anal. Appl., 23, 421 (1968)
[13] Zadeh, L. A., Quantitative fuzzy semantics, Electronics Research Laboratory, (Report ERL-M281 (1970), University of California: University of California New York) · Zbl 0218.02057
[14] Zadeh, L. A., Probl. Transmission of Information, 2, 37 (1966) · Zbl 0263.02028
[15] Zadeh, L. A., Similarity relations and fuzzy orderings. Electronics Research Laboratory, (Report ERL-M277 (1970), University of California: University of California Berkeley) · Zbl 0218.02058
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.