| RACSODFACFGOperations: Reg, CFPDAReductions: K, WP, CFG, NP, SATANTLR: lexical, syntacticExams | log in, register, become guest |
This website has a collection of exercises for the subject «Theory of Computation», that is: exercises asking to define recognizers / generators of formal languages (regular or context-free), as well as exercises asking for reductions between problems (undecidable or NP-complete).
All the exercises are automatically judged: after submitting a solution proposal, the system returns in a few seconds an acceptance / rejection verdict. To help the students, rejection verdicts also include counterexamples.