Content deleted Content added
clarified details of representation, linked to string processing languages |
No edit summary |
||
Line 1:
A string
In the [[theory of computation]] strings are also often called words, and the letters are elements from an arbitrary finite set.
=== Representations ==
Line 14 ⟶ 15:
The above example is how "FRANK" would look in a 10 byte NUL terminated string. Characters after the 0 do not form part of the representation.
Of course, other representations are possible. Using [[tree]]s and [[list]]s
=== String Processing ===
Line 25 ⟶ 26:
* [[sed]]
Many [[UNIX]] utilities perform simple string manipulations and can be used to easily program some powerful string processing algorithms. Files and finite streams may be viewed as strings.
----
/Talk
|