40:18 thanks guy at that class on 2012, i had the same doubt Edit: after finishing the lecture I wanna thank you for uploading this, I had a notion on automata but there were things that I wasn't aware of, this series really opened my mind to the computational power that automata has (specially the "parallel computation" when they are non deterministic blew my mind), and now I can understand more of why they are such a valuable resource to study theoretical CS.
Each time a character is read it will either push it to the stack (staying in q2), or move to q3. In fact it does both - because it can choose either option it will try each one in turn. The machine can (and does) attempt to parse the input string in many different ways - one time it'll just read one character then move to q3, another time it'll read 2 characters etc. Most of those will fail but if the input string is a palindrome one instance of the machine will succeed.
I do not understand how this works at 1:05:08 onwords. The input strings (ex: 0110) is completely consumed in the loop in q2. The string reaches "end". Where is the question of 'epsilon' ? Where does that appear ?
what was the story on the molecular biology and mathematician and cross culture confusion ... if that's not too private .. we want to hear the same as well...
Instead of these rather horrid diagarms, would it not be possible to use a structured pseodocode - wih certain conventions or KEYWORDS. When people first started to write computer programs, their first instinct was to draw flowcharts. Now people write pseudocode, instead.
It's a 4 years old comment but w/e, this is theoretical computer science, not programming, it's like asking a mathematician to use pseudocode instead of algebraic notation, those diagrams are a lot more exhausting and gets to the point better than pseudocode could ever do.
![[#2024MAMA] G-DRAGON - 무제(Untitled, 2014)+POWER+HOME SWEET HOME+뱅뱅뱅+FANTASTIC BABY | Mnet 241123 방송](http://i.ytimg.com/vi/Ox29z5Nf1Uk/mqdefault.jpg)
40:18 thanks guy at that class on 2012, i had the same doubt
Edit: after finishing the lecture I wanna thank you for uploading this, I had a notion on automata but there were things that I wasn't aware of, this series really opened my mind to the computational power that automata has (specially the "parallel computation" when they are non deterministic blew my mind), and now I can understand more of why they are such a valuable resource to study theoretical CS.
Thank all the guys who asked questions in the class!
"the push-down automaton has to have ... some kind of gizmo or doohinkey" - love it!
thank you for sharing all the lectures, why is my teacher not that good? :(
Each time a character is read it will either push it to the stack (staying in q2), or move to q3. In fact it does both - because it can choose either option it will try each one in turn. The machine can (and does) attempt to parse the input string in many different ways - one time it'll just read one character then move to q3, another time it'll read 2 characters etc. Most of those will fail but if the input string is a palindrome one instance of the machine will succeed.
This lecture is very clearly taught, thank you!
thank you for sharing all the lectures
Great teacher! Wish I had been in his class for CS theory.
Thank you from istanbul.
i have stupid question, why would we need push down automata to describe CFG ,according to Church these every computing Machine does the same
I do not understand how this works at 1:05:08 onwords. The input strings (ex: 0110) is completely consumed in the loop in q2. The string reaches "end". Where is the question of 'epsilon' ? Where does that appear ?
At 00:28, Will F be not a power set of Q instead of F ?
what was the story on the molecular biology and mathematician and cross culture confusion ... if that's not too private .. we want to hear the same as well...
This video was extremely useful to understand CFG. Thank you.
Fascinating, thank you for sharing
Thank you sir. That clarifies.
which university is this?
university of california at davis
thanks from Greek Ceid
thank you
Thank you for sharing. Also, the professor is kinda cute. lol
Instead of these rather horrid diagarms, would it not be possible to use a structured pseodocode - wih certain conventions or KEYWORDS.
When people first started to write computer programs, their first instinct was to draw flowcharts. Now people write pseudocode, instead.
It's a 4 years old comment but w/e, this is theoretical computer science, not programming, it's like asking a mathematician to use pseudocode instead of algebraic notation, those diagrams are a lot more exhausting and gets to the point better than pseudocode could ever do.
Pseudo - code would make this a disaster, diagrams are much better.
XArticSpartanX can confirm, prof in my course uses mostly pseudo code and nothing makes sense