Content deleted Content added
Matthiaspaul (talk | contribs) →See also: +link |
Jasper Deng (talk | contribs) →Formal theory: palindrome Tags: Mobile edit Mobile web edit Advanced mobile edit |
||
Line 14:
* |ε| = 0. Its [[string (computer science)#Formal theory|string length]] is zero.
* ε ⋅ s = s ⋅ ε = s. The empty string is the [[identity element]] of the [[concatenation]] operation. The set of all strings forms a [[free monoid]] with respect to ⋅ and ε.
* ε<sup>R</sup> = ε. Reversal of the empty string produces the empty string, so the empty string is a [[palindrome]].
* <math>\forall c \in s: P(c)</math>. Statements that are about all characters in a string are [[vacuous truth|vacuously true]].
* The empty string precedes any other string under [[lexicographical order]], because it is the shortest of all strings.<ref>[http://cs.fit.edu/~ryan/cse1002/lectures/lexicographic.pdf CSE1002 Lecture Notes – Lexicographic]</ref>
| |||