For functional programmers, tree automata here are tree folds / catamorphisms. In the case of normal string automata, you should view strings as snoc-lists (foldl) rather than cons-lists (foldr). In this way you see the relationship between automata theory and recursion schemes.
Super underrated channel. Maybe the content is just really niche, but I think all your videos are awesome.
I loved your previous series! excited for this one too:)
For functional programmers, tree automata here are tree folds / catamorphisms.
In the case of normal string automata, you should view strings as snoc-lists (foldl) rather than cons-lists (foldr).
In this way you see the relationship between automata theory and recursion schemes.