The goal of the Automata Tutor is to help students learn basic concepts in automata theory and to help teachers preparing and grading exercises and problem sets. Automata Tutor currently supports DFA, NFA, NFA to DFA, and regular expression constructions.
- The tool provides a set of problems which you can attempt by signing up and logging in. When you login you will find Practice Problems on the left;
- When submitting an incorrect solution, Automata Tutor will provide a grade and feedback message to help you progress.
- If you are an instructor please send us an email at loris at cs.wisc.edu so that we can enable course managament for you.
If you have questions/ comments / suggestions/ feature requests, please contact us at loris at cs.wisc.edu.
A first version of the tutor was designed by Pavol Cerny, Arjun Radhakrishna, and Damien Zufferey. The new Automata Tutor is designed, developed, and maintained by Rajeev Alur, Loris D'Antoni, Björn Hartmann, Sumit Gulwani, Dileep Kini, Mahesh Viswanathan, Matthew Weaver and Alexander Weinert. The project involves the following institutes: University of Pennsylvania, Microsoft Research, University of Illinois, and University of California Berkeley.
If you want to learn more about how Automata Tutor works check these papers:
- Automated Grading of DFA Constructions, R. Alur, L. D'Antoni, S. Gulwani, D. Kini, and M. Viswanathan, IJCAI 2013
- How Can Automatic Feedback Help Students Construct Automata?, L. D'Antoni, D. Kini, R. Alur, S. Gulwani, M. Viswanathan, B. Hartmann, TOCHI 2015
Our work is supported by the National Science Foundation under the following grants:
- 1138996: ExCape expedition on Program Synthesis.