Chomsky Hierarchy for Languages

[@yanncaron982]

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.

[@mattlehmann9782]

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.

[@chillbeats4047]

do you have anything on action and goto tables?

[@arik_dev]

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.

[@MP-vy2mi]

Excellent, thank you

Helped a lot, thank you very much! :)

[@Nyamu0]

Thank you for this good lecture

[@violinonero]

I thought it was "automaton" for singular and "automata" for plural. what the hell is "automator", used in a singular context?

[@Alley00Cat]

+violinonero Unnecessary...