This is pretty amazing! Why does this have so few views while the incomprehensible ones have ~100k?
@codingwithmat
8 жыл бұрын
+Ville Peltoniemi Just give it a like and leave a comment and you'll be helping Prof. Porter out!
@villepeltoniemi5004
8 жыл бұрын
+Matheus Gomes that's the plan
@alfin3644
4 жыл бұрын
Because KZitem sucks. Also, the others had a head start of years, and tricks for the algos.
@zetadimensions
2 жыл бұрын
Indians, that's why
@nicksdudep
7 жыл бұрын
u sir are amazing . i pay so much in tuition in college but the teachers don't make sense at all . i hated TOC before , but after watching ur vids this subject seems pretty easy . keep up the good work prof.
@abhishekKumarroy
8 жыл бұрын
great videos mr. porter.i will surely recommend it to my mates
@qwertyuiop-ke7fs
8 жыл бұрын
Is there some algorithmic way to deduce an equivalent DFA from an NFA? Something a computer program could do?
@TheTechnicalman
6 жыл бұрын
Thank you so much. What about the AC state is one of the possible states? if Yes how ?
@ThuyNguyen-bu9ge
8 жыл бұрын
The P(Q) is all of Q's subsets. Shouldn't delta map to a subset of the power set? If delta maps to the P(Q), this means that a state and symbol goes to all of the subsets of Q?
@nipunparadkar9458
8 жыл бұрын
At around 10:52. Suppose q1 doesn't have an epsilon transition, then will you write {q1} in the epsilon column or PHI?
@sannanahmadbhatti4491
7 жыл бұрын
Can u plz upload the link for the notes as well?
@paritoshkapadia9979
7 жыл бұрын
If there are two zeroes at the last and second to last positions, they should be accepted, right? Why does your dfa not accept them?
@matthewtaormina7145
4 жыл бұрын
So would it be fair to say non-deterministic FSM use recursion as they try different paths?
@yannickpezeu3419
3 жыл бұрын
Would you mind if I one day translated your course to french ?
@wenaolong
8 жыл бұрын
It is nice that the Non-Deterministic models are simplifications which act as not merely "deus ex machina" (pun unintended), but also act as placeholders in a design theory that can eventually accommodate further data which completely determines the machine, taking the places of the epsilon edges, theoretically merging with them without contradiction. Humans have such cognitive heuristics already, which are the fundamental intuitions about what is knowledge which happen to be "magically" true, but true nonetheless. They also came into being before the human language was the faintest possibility, according to some, but perhaps would have remained nascent until language and technologies such as we have now made them "mechanizable". "Epsilon" edged automata may be amenable to all manner of logical structures, and all of this could be predicted to have outcomes in determinable systems at least theoretically, and possibly even with practical applications testing the most abstract of ideas about the world, and even the most difficult to determine. Especially with the help of quantum mechanical computing in addition to artificially intelligent software.
@hyphenpointhyphen
7 жыл бұрын
I'm not sure, but couldn't the first DFA just have 3 states? States: q1,q2,qf Transitions: q1:0->q2; q1:1->q1; q2:0,1->qf; qf:0->qf; qf:1->q2
@kaasboyzz
5 жыл бұрын
7:24 shouldn't q6 itself be included in the set as well?
@LeJeuCommence
8 жыл бұрын
HA! I knew it would be 2^N. I'm a good computer scientist. Harry Potter said so.
@huckthatdish
7 жыл бұрын
he didn't say if and only if. your logic fails, bad computer scientist
@matthewtaormina7145
4 жыл бұрын
at 4:17, is that NDFSM basically an Or of two DFSM.
@michalziobro1984
5 жыл бұрын
Good content!
@rongrongmiao4638
8 жыл бұрын
Did he said something like non-deterministic Turing machine or it's just me?
@kishalayghosh1865
8 жыл бұрын
+Rongrong Miao its you :p
@SurabhyaAryal
7 жыл бұрын
kzitem.info/news/bejne/uW6k0oWGsnqko2km55s
@SurabhyaAryal
7 жыл бұрын
he says so.
@Tank4931
4 жыл бұрын
Hello, can someone help me beating the professor challenge? It would help! (the equivalent DFA of the 2 strings who contains 0100 and 0111)
@charleyriley5829
4 жыл бұрын
You can do it with 7 states like so: F and G are accept states In matrix form, 0 1 a: b a b: b c c: d e d: f c e: b g f: f f g: g g
Пікірлер: 33