. . "RIV/61989592:15310/07:00004947" . . "500"^^ . "RIV/61989592:15310/07:00004947!RIV10-MSM-15310___" . . "Krupka, Michal" . "Approximate minimization of fuzzy automata"@en . . "[97385CF05F2F]" . "410599" . . "World Scientific Publishing Company" . . . . . . "2"^^ . . "The paper presents a contribution to minimization of fuzzy automata. Traditionally, the problem of minimization of fuzzy automata results directly from the problem of minimization of ordinary automata. That is, given a fuzzy automaton, describe an automaton with the minimal number of states which recognizes the same language as the given one. In this paper, we formulate a different problem. Namely, the minimal fuzzy automaton we are looking for is required to recognize a language which is similar to the language of the given fuzzy automaton to a certain degree a, such as a = 0.9, prescribed by a user. That is, we relax the condition of being equal to a weaker condition of being similar to degree a." . . "Z(MSM6198959214)" . "Approximate minimization of fuzzy automata" . "2"^^ . "The paper presents a contribution to minimization of fuzzy automata. Traditionally, the problem of minimization of fuzzy automata results directly from the problem of minimization of ordinary automata. That is, given a fuzzy automaton, describe an automaton with the minimal number of states which recognizes the same language as the given one. In this paper, we formulate a different problem. Namely, the minimal fuzzy automaton we are looking for is required to recognize a language which is similar to the language of the given fuzzy automaton to a certain degree a, such as a = 0.9, prescribed by a user. That is, we relax the condition of being equal to a weaker condition of being similar to degree a."@en . "Singapore" . . "Approximate minimization of fuzzy automata"@en . "15310" . . "B\u011Blohl\u00E1vek, Radim" . "Approximate minimization of fuzzy automata" . "Proceedings of the 10th Joint Conference on Information Sciences" . "finite automata; fuzzy logic; minimization"@en . "978-981-270-967-7" . .