Talk:String (computer science): Difference between revisions

Revision as of 20:35, 29 December 2024

Revision as of 20:37, 29 December 2024

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)

:fuck you add every thing you've done i'll disprove every medical field book you have on psychology . you no hitler or god and you know that i can prove my end but you bitches too scared to shown up by uneducated farmer that you fuck with their whole goddamn life and you still learn more than you ever fucking did in your whole goddamn education [[Special:Contributions/2600:1005:B003:9156:0:0:66DA:3D01|2600:1005:B003:9156:0:0:66DA:3D01]] ([[User talk:2600:1005:B003:9156:0:0:66DA:3D01|talk]]) 20:35, 29 December 2024 (UTC)

== Traditionally? ==