I think the most easily comprehensive video about theory of computation I have ever seen. Thanks a lot for that. I am understanding it can be possible to enhance my LL(*) parser with context sensitive primitive (multi stack like you explain for PDA)..... great stuff. Keep the good work.
Your FSA has an error as it shows two arrows emanating from "Yes" given b. Also, I think that the naming of the states Yes/No is ineffective since you enter a No state while parsing a valid string, which is counter intuitive.
Is that first graph technically a Petri Net? Seems like it. It has (a) and (b) tokens, transitions, a source and a sink, The only thing you'd have to do to it is replace the edges with a transition vertex with edges connecting the vertices of the original two vertices to the transition vertex.
I think the most easily comprehensive video about theory of computation I have ever seen. Thanks a lot for that.
I am understanding it can be possible to enhance my LL(*) parser with context sensitive primitive (multi stack like you explain for PDA)..... great stuff.
Keep the good work.
Your FSA has an error as it shows two arrows emanating from "Yes" given b. Also, I think that the naming of the states Yes/No is ineffective since you enter a No state while parsing a valid string, which is counter intuitive.
Excellent, thank you
do you have anything on action and goto tables?
Thank you for this good lecture
Helped a lot, thank you very much! :)
Is that first graph technically a Petri Net? Seems like it. It has (a) and (b) tokens, transitions, a source and a sink, The only thing you'd have to do to it is replace the edges with a transition vertex with edges connecting the vertices of the original two vertices to the transition vertex.
I thought it was "automaton" for singular and "automata" for plural. what the hell is "automator", used in a singular context?
+violinonero Unnecessary...