نتایج جستجو برای: coaccessible accessible general fuzzy recognizer
تعداد نتایج: 858005 فیلتر نتایج به سال:
In this paper, we prove that any BL-general fuzzy automaton (BL-GFA) and its quotient have the same behavior. In addition, we obtain the minimal quotient BL-GFA and minimal quotient transformation of the BL-GFA, considering the notion of maximal admissible partition. Furthermore, we show that the number of input symbols and time complexity of the minimal quotient transformation of a BL-GFA are ...
We have constructed a system for recognizing multi-character images 1. This is a nontrivial extension of our previous work on single-character images. It is somewhat surprising that a very good single-character recognizer does not in general form a good basis for a multi-character recognizer. The correct solution depends on three key ideas: 1) A method for normalizing probabilities correctly, t...
In this paper we propose a recognition system for handwritten manuscripts by writers of the 20th century. The proposed system first applies some preprocessing steps to remove background noise. Next the pages are segmented into individual text lines. After normalization a hidden Markov model based recognizer, supported by a language model, is applied to each text line. In our experiments we inve...
We solve the following problem proposed by H. Straubing. Given a two letter alphabet A, what is the maximal number of states f(n) of the minimal automaton of a subset of An, the set of all words of length n. We give an explicit formula to compute f(n) and we show that 1 = lim n→∞ nf(n)/2n ≤ limn→∞ nf(n)/2 n = 2. The purpose of this note is to solve the following question, raised by H. Straubing...
We have developed the notion of lexicon density as a metric to measure the expected accuracy of handwritten word recognizers. Thus far, researchers have used the size of the lexicon as a gauge for the difficulty of the handwritten word recognition task. For example, the literature mentions recognizers with accuracy for lexicons of sizes 10, 100, 1000, and so forth, implying that the difficulty ...
Computational complexity of general fuzzy logic control and its simplification for a loop controller
This paper analyzes the number of operations and parameters of general fuzzy logic control algorithms. And limitations of loop controllers to implement the fuzzy logic control are investigated in terms of computation time and required memory. Using analysis of general fuzzy logic control algorithms, it is shown that general fuzzy logic control algorithms are not suitable for loop controllers. A...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید