|
|
|
|
I don't know either, but I'm responsible for knowing it.
|
TrackStar
|
Yea, the problem is with the first one... it does it over and over and never lets you get to the rest of the problem... your teach as PUNK'd you!
Tuesday, June 13, 2006 8:22 AM
|
Linus
Westchase, FL
|
All I see is "wtf?"
Tuesday, June 13, 2006 8:24 AM
|
shchmue
Tampa
|
i see... umm... set theory symbols... and electrical engineering symbols? i'd look it up but then it would lose the intended mystique.
Tuesday, June 13, 2006 8:31 AM
|
Imperfect Clark
|
^^^
NO
Tuesday, June 13, 2006 8:57 AM
|
CallMeEleanor
|
Child's play.
I, as always, admire your academic endeavors in awe and respect.
Tuesday, June 13, 2006 9:05 AM
|
CallMeEleanor
|
x2.
[Edited by CallMeEleanor on 6/12/2006 11:05:52 PM. Reason for edit: /]
Tuesday, June 13, 2006 9:05 AM
|
ForTheOrca
|
NFA? I never got headaches during tests until I took that class. NFA M is a 5-tuple that...gggggzzzzzurgegle...
Tuesday, June 13, 2006 9:10 AM
|
Imperfect Clark
|
Yeah, it's the potential accepting states are selected from a pool of (length of Q powerset) possible states and AWWWRRGeerrghgh *must... resist... brain... thing.*
fruit.
Tuesday, June 13, 2006 9:18 AM
|
timeconsumerx
|
the complex conjugate of sigma for set qsub0, abab is equal to the union of sigma of set p,b where p includes the complex conjugate of sigma for set qsub0, abab
equals the union of sigma of set p,b where p includes qsub0,1,3
equals sigma qsub0,b and the union of sigma qsub1,(3),b
implies that the given set equals qsub0, qsub2
this shit is so fucking gay. what a horrific proof.
Tuesday, June 13, 2006 9:32 AM
|
Imperfect Clark
|
yapp.
note, p is a "production" where, a production is some mapping from some state q from set Q, to some other state in Q. That crazy symbol that p is an element of is the set of productions possible in the domain of the transition function defined for the acceptor.
The problem gets hairy because, this being a non-deterministic acceptor, means you can end up at different states for the same input symbol.. so at each step you have to analyze the possible scenarios that could've led up to that position, then determine all the possible scenarios that could happen from there. This algorithm is a way of turning the non-deterministic diagram (shown) into a deterministic one (where a one-to-one relationship exists between input and state transitions).
Tuesday, June 13, 2006 10:02 AM
|
timeconsumerx
|
i'm taking deterministic OR this fall.
Tuesday, June 13, 2006 1:01 PM
|
Lysander
|
[Edited by Lysander on 1/12/2007 10:26:08 AM. Reason for edit: .]
Friday, October 6, 2006 3:35 PM
|
Alan
Tampa, FL
|
Fucking cocksucking educators. You don't teach kids with equations like this, jackasses; they'll never get it. Automata Theory isn't that difficult, but you give it to somebody in fucking Linear A and they're not gonna get it. Your professor needs to be bitch-slapped for this.
Friday, January 12, 2007 5:35 PM
|
Imperfect Clark
|
Yeah.. the logic of the machine is simple, but theory purists love "disambiguating" algorithms with mathematics. The only point of knowing such formal definition is for proofs, which really are not the Computer Scientist's concern.
Saturday, January 13, 2007 5:07 AM
|
Lysander
|
cloggin up their brains imo
Saturday, January 13, 2007 7:27 AM
|
|
|
|
