Content deleted Content added
→Distinct, unambiguous symbols: new section |
Stevebroshar (talk | contribs) →Traditionally?: new section |
||
Line 156:
As far as I know, it is also required that each string can be uniquely decomposed into its symbols. For example, if the alphabet itself consists of strings (as in [[Free_monoid#Free_generators_and_rank]], or in the lead of [[Alphabet (formal languages)]], with Σ = {"0", "00"}), its symbols are distinct and unambiguous (as are the members of each mathematical set), but nevertheless, a string may be composed in different ways. I guess "unambiguous" is supposed to express the requirement of unique decomposition, but I'm not sure it is precise enough. The decomposition must be unambiguous, rather than just the symbols. - [[User:Jochen Burghardt|Jochen Burghardt]] ([[User talk:Jochen Burghardt|talk]]) 18:03, 13 May 2024 (UTC)
== Traditionally? ==
WRT "In computer programming, a string is traditionally a sequence of characters..." What does 'traditionally' imply? What does it string mean in a non-traditional sense? How is traditionality relevant? IMO it is a sequence of chars (period or full-stop as they say across the pond). [[User:Stevebroshar|Stevebroshar]] ([[User talk:Stevebroshar|talk]]) 14:03, 20 December 2024 (UTC)
| |||