CS150 S21 - Shared screen with speaker view
Who can see your viewing activity?
27 people w.w
It is very useful
Amir is very helpful
I mostly use discussion to remind me of what the topics are. Like last night was about the pumping lemma which put it back into my mind, and was super nice
probably just tired from midterms
I still go to lecture otherwise I wont watch them lol
What about B and H
are only 0 and 1 transitions allowed here?
is A = E?
If a DFA had two or more end states, would the equivalence need the initial states to end in the same node, or is just being in a goal state sufficient?
Alright, just wanted to make sure. Thank you!
if when input is 1 both a and b will lead to the final state but when its 0 they both a and b point to different state. Are we still considering both state equivalent?
you have to check every inequivolence pair right? so the order you check does not really matter
So the empty cells would represent the equal states after we checked all crosses?
It kind of does not make sense that two DFA's are equivalent only because their starting states are the same!
wait how does this table show us that they are equivolent
so as long as no x in A - C they are equivalent?
All nodes are not equivalent
run algorithm and see new states are all x?
ends in 0
Patrick D Fenn
thank you professor
Yishao Wang Wang
Have a good weekend!