I'm making this to perhaps preemptively get in contact with someone who may be willing to check my work and answer some questions I may have.. Please let me know if you're interested and/or willing! I will have my work posted shortly.
>>331869
A Discrete (Math Genius) or a (Discrete Math) Genius?
>>331901
http://lmgtfy.com/?q=discrete+vs+discreet
>>331901
I'll accept either :)
>>331869
>making a thread asking if you can ask a question
wew lad you will sure go far in life. dumbass.
>>332052
I don't have any questions yet, so it's only in my benefit to potentially get in contact with someone early before I really do need help.
Now do you understand?
looks kind of satanic, you sure this is math?
>>332089
pic in OP isn't actually that related to what I'm doing, but pic related is. So anon, please answer C and then take a look at this problem below c in this link:
http://www.chegg.com/homework-help/questions-and-answers/work-fsas-alphabet-b---give-regular-expression-draw-fsa-language-strings-two-s-b-give-regu-q22460413
These two have currently got me stumped.
>>332183
aab is accepted by a*b* so (aab | a*b*) is the same as aab .
You can recognise a*b* with
0; ACCEPT; a->0, b->1 else -> 2
1; ACCEPT; b->1, else ->2
2; REJECT
>>332193
And that was your answers to the question after C in the chegg link, the one that is supposed to describe the automata in the image? It was actually question D, but whoever posted that fucked it up.
>>332183
I have no idea what a "FBTSA" is, I have literally never encountered the term and Google is no help.
The answer's going to hinge on what a FBTSA is, because trivially a FSA that had one state and every symbol transitioned back to it would have no upper bound whatsoever.
>>332195
Oh it was just a convenient abbreviation for full binary tree state automata, I forgot to mention it
>>332183
Bump