265 reputation
18
bio website
location
age
visits member for 3 years, 7 months
seen Apr 26 '13 at 2:15

Jul
21
awarded  Popular Question
Jul
2
awarded  Curious
Feb
25
awarded  Popular Question
Feb
14
accepted How to draw this finite state automaton?
Dec
13
accepted What is a conservative/intersective function?
Dec
13
comment What is a conservative/intersective function?
Well that part wasn't provided......if it was, I wouldn't need to be asking
Dec
13
asked What is a conservative/intersective function?
Dec
5
awarded  Yearling
Nov
6
accepted An efficient way to determine if two context free grammars are equivalent?
Nov
6
asked An efficient way to determine if two context free grammars are equivalent?
Oct
8
accepted Cardinality of the set {10, (8+2)}
Oct
7
asked Cardinality of the set {10, (8+2)}
Aug
14
accepted Why isn't this a regular language?
Aug
13
accepted Recursively enumerable set? Any hints?
Aug
13
asked Recursively enumerable set? Any hints?
Aug
13
comment What's the difference between a set and a language?
So the TM's CAN be identical, if we first choose to encode the string "7" to aaaaaaa before running it thru the TM?
Aug
13
accepted What's the difference between a set and a language?
Aug
13
comment What's the difference between a set and a language?
I understand now. Thank you very much, you are a lifesaver
Aug
13
comment What's the difference between a set and a language?
Ohhh I see. We're talking about the number of a's being prime vs an ACTUAL prime number?
Aug
13
comment What's the difference between a set and a language?
Yes there is, so it's decidable? Wouldn't the Turing Machine for this be identical to the Turing Machine with the language $a^n$ where $n$ is a prime number? (this can be accomplished with 2 tapes)