Math 2.0

Concept

Weight (strings)

Summary

The aa-weight of a string, for a letter aa, is the number of times that letter occurs in the string. More precisely, let AA be a finite set (called the alphabet), a∈Aa\in A a letter of AA, and c∈A∗c\in A^* a string (where A∗A^* is the free monoid generated by the elements of AA, equivalently the set of strings, including the empty string, whose letters are from AA). Then the aa-weight of cc, denoted by wta(c)\mathrm{wt}_a(c), is the number of times the generator aa occurs in the unique expression for cc as a product (concatenation) of letters in AA.

Further reading

  1. Wikipedia, page 6417882, revision 921563850, Weight (strings). adopted
About this page
TagTKBPPBP9C6
URIm2://TKBPPBP9C6
Kindconcept
WritingW1 stated
Same as
Changed4 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W2

  • edge defines in: at least one definition (0 of 1)
  • edge instance_of in: at least two examples (0 of 2)
  • edge not_instance_of in: at least one non-example (0 of 1)
  • edge specializes both: the more general notions and the special cases (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.