Sentence examples for leading word from inspiring English sources

Five years ago WordPerfect was the world's leading word processor, with more than 50percentt of the market.

In acronyms beginning with a consonant that can be hard or soft, the leading word of the expanded version tends to determine the sound.

Throughout the 1980s WordPerfect ranked as the most popular word-processing software on PCs, but since the 1990s Microsoft Word has become the leading word processor for both Windows and Macintosh users.

Then every nonzero polynomial f ∈ K 〈 X 〉 has the leading word f ¯.

Take f ∈ k ⟨ X ⟩ with the leading word f ¯ and f = α f ¯ - r f, where 0 ≠ α ∈ k and r f ¯ < f ¯.

If g is monic, f ¯ = a g ¯ b and α is the coefficient of the leading term f ¯, then transformation f ↦ f − α a g b is called elimination (ELW) of the leading word of g in f.

He suggested instead that a GS basis must be minimal (the leading words do not contain each other as subwords).

Another key lemma says that if S is a GS basis and the leading words of two normal S -terms are the same then these terms are the same modulo lower normal S -terms.

This S c is called the GS completion of S. Using the reduction algorithm (elimination of the leading words of polynomials), we may obtain a minimal GS basis S c or a reduced GS basis.

Given a k -monic subset S ⊂ L i e k [ Y ] ( X ) and w ∈ [ Y ] X ∗, which is not necessarily in T A, an element h ∈ L i e k [ Y ] ( X ) is called trivial modulo ( S, w ) if h can be expressed as a k [ Y ] -linear combination of normal S -words with leading words smaller than w.

The ALSW w includes u = s 1 ¯ and v = s 2 ¯ as subwords, and so there is a bracketing { w } ∈ { [ w ] u, v, [ w ] u, [ w ] v } such that [ a 1 s 1 b 1 ] = [ c { w } | [ u ] ↦ s 1 d ], [ a 2 s 2 b 2 ] = [ c { w } | [ v ] ↦ s 2 d ] are normal s 1 - and s 2 - words with the same leading associative word w 1.