It depends on what you need it for. If you need a bit of string to tie your hair back 6 inches should do it, but if you need a bit of string to tie up newspapers for recycling you'll need between 4 or 5 feet. However, when someone says bit of string to me, I'm thinking of less than 24 inches. My husband thinks of 4 to 5 feet of string when asked for a bit so it not only depends on how you intend to you it, but also culture differences as well.
2007-09-21 17:10:52
·
answer #2
·
answered by kcpaull 5
·
0⤊
0⤋
Intrinsically a piece of string has length but that length is unknown hence the
: the phrase 'how long is a piece of string' means that the quantitative answer is not known and there is an implicate understanding that the answer will be difficult to find given the information available.
Often the reply you get from a builder when you ask them for a quotation for a Job..
Cring Time:
Piece of string walks into the bar. "Are you a piece of string?" asks
the barman.
"Yes," replies the piece of string.
"Sorry mate, you'll have to leave, we don't serve your kind here."
The piece of string leaves, disappointed. The next day he ties a knot
in his middle, ruffles up one end of himself, and goes back in.
"Oi! I told you yesterday to get out, you're that piece of string
aren't you?"
"No, I'm afraid not."
Try this;
Let Σ be an alphabet, a non-empty finite set. Elements of Σ are called symbols or characters. A string (or word) over Σ is any finite sequence of characters from Σ. For example, if Σ = {0, 1}, then 0101 is a string over Σ.
The length of a string is the number of characters in the string (the length of the sequence) and can be any non-negative integer. The empty string is the unique string over Σ of length 0, and is denoted ε or λ.
The set of all strings over Σ of length n is denoted Σn. For example, if Σ = {0, 1}, then Σ2 = {00, 01, 10, 11}. Note that Σ0 = {ε} for any alphabet Σ.
The set of all strings over Σ of any length is the Kleene closure of Σ and is denoted Σ*. In terms of Σn, . For example, if Σ = {0, 1}, Σ* = {ε, 0, 1, 00, 01, 10, 11, 000, 001, 010, 011, …}. Although Σ* itself is countably infinite, all elements of Σ* have finite length.
A set of strings over Σ (i.e. any subset of Σ*) is called a formal language over Σ. For example, if Σ = {0, 1}, the set of strings with an even number of zeros ({ε, 1, 00, 11, 001, 010, 100, 111, 0000, 0011, 0101, 0110, 1001, 1010, 1100, 1111, …}) is a formal language over Σ*.
Going now...
2007-09-21 17:47:35
·
answer #3
·
answered by watercress kebab 4
·
1⤊
0⤋
Do you know, that is the one sentance that really annoys me so much!!!!
I find its the most frustrating thing, when I ask a question, and I get that as an answer. I hope someone will come up with a real "Smart Alex " remark, to answer this will, watching this space with much interest..........GOOD question!
2007-09-21 17:07:41
·
answer #7
·
answered by SUPER-GLITCH 6
·
0⤊
0⤋