Content deleted Content added
TakuyaMurata (talk | contribs) literal string not just string |
TakuyaMurata (talk | contribs) mNo edit summary |
||
Line 43:
In theoretical computer science, one starts with a [[empty set|non-empty]] [[finite]] [[set]] called the ''alphabet''; strings are then defined as finite sequences of elements from the alphabet, including the empty sequence. The set of all strings over a given alphabet, together with string concatentation, then forms a [[monoid]], in fact a free monoid. [[Formal language]]s, the central objects of study, are defined as [[subset]]s of this monoid.
-------------▼
See [[String]]
|