検索結果- 英語 - 多言語
検索内容:
pumping lemma
(computer science) A lemma which states that for a language to be a member of a language class any sufficiently long string in the language contains a section that can be removed or repeated any number of times with the resulting string remaining in the language, used to determine if a particular language is in a given language class (e.g. not regular).
pumping lemmas
plural of pumping lemma
Zorn's lemma
(set theory) A proposition of set theory stating that every partially ordered set, in which every chain (i.e. totally ordered subset) has an upper bound, contains at least one maximal element.
non-lemmas
non-lemma
(lexicography, rare) Any form of a lexeme that is not its lemma.
Teichmüller-Tukey lemma
(mathematics) A lemma stating that every non-empty collection of finite character has a maximal element with respect to inclusion.
Neyman-Pearson lemma
(statistics) A lemma stating that when performing a hypothesis test between two point hypotheses H₀: θ = θ₀ and H₁: θ = θ₁, then the likelihood-ratio test which rejects H₀ in favour of H₁ when 𝛬(x)=(L(𝜃₀∣x))/(L(𝜃₁∣x))≤𝜂 where P(𝛬(X)≤𝜂∣H_0)=𝛼 is the most powerful test of size α for a threshold η.
Riemann-Lebesgue lemma
(mathematics) A lemma, of importance in harmonic analysis and asymptotic analysis, stating that the Fourier transform or Laplace transform of an L1 function vanishes at infinity.
