Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
I’m studying for an automata test on a course that’s heavily based on jflap. Trouble is we don’t have much documentation and the sample automata that I’ve found on jlap like this and this, are insufficient to prepare for the upcoming test.
Where can I find more? Any other resource with sample turing machines shown as graphs with transitions would also be helpful.
“Problem solving in automata, languages and complexity” is a fantastic textbook for anything related to… anything in its title. Among other things, you can find a bunch of examples of DFAs/NFAs/PDAs/TMs for all sorts of things, and they teach you a lot of techniques for building them.
Edit: that first link of yours keeps talking about “nondeterministic NPDAs” and “deterministic NPDAs”. I’m writing this edit just to satisfy my urge to denounce such pleonasms and oxymora 🙂