Home

This Wiki is intended to familiarize users with the TheoryAssistant package as well as provide a sample implementation of an autograder for a typical assignment one would see in an introductory undergraduate course on the theory of computation.

A good starting point is the introduction to the more useful methods in the public API for the Finite Automata classes (NFA and DFA).

From there, proceed to a description of the GrafState syntax for describing finite automata. Next, move on to the description of the Parser class which is used to instantiate objects of the Finite Automata classes from descriptions in GrafState syntax.

Next, see the Sample Assignment, Submission and Solution Sets page for a description of the sample assignment, solutions and submission sets provided in this repo and which are evaluated by the provided autograder.

After that, a quick primer on the importance of naming conventions, how to package and use a JAR file containing the TheoryAssistant package in an autograder project, as well as sample rubric for the sample assignment are all briefly explained. And finally the autograders are presented and explained in light detail.

Good luck and god speed!