I'm looking for some good source of Finite automata, pushdown automata and Turing machine tasks examples (for solving manually, by hand).
I was searching around but didn't find nothing special so I'm wondering if someone's got some good examples. Thanks in advance.
Your best bet might be to get a book on the subject, such as Introduction to the Theory of Computation, Third Edition by Michael Sipser, and then work through the exercises.
For a collection of problem sets on automata, along with solutions, check out Stanford's introductory course in the theory of computation. Problem Sets 5, 6, and 7 directly talk about automata (finite, pushdown, and Turing machines), along with equivalent representations (regular expressions and context-free grammars).
Hope this helps!
来源：https://stackoverflow.com/questions/12164479/finite-automata-pushdown-automata-and-turing-machine-examples