Due to the pandemic, we had to switch our satisfiability checking lecture to an online format.
To create space for interaction, we gave the students the opportunity to earn bonus points for …

Almost all Computer Science programs require students to take a course on the Theory of
Computation (ToC) which covers various models of computation such as finite automata …

Foundations of formal languages, as subfield of theoretical computer science, are part of
typical upper secondary education curricula. There is very little research on the potential …

We propose a scalable framework for deciding, proving, and explaining (in) equivalence of
context-free grammars. We present an implementation of the framework and evaluate it on …

Computing theory is often perceived as challenging by students, and verifying the
correctness of a student's automaton or grammar is time-consuming for instructors. Aiming to …

Deterministic and nondeterministic finite automata (DFAs and NFAs) are abstract models of
computation commonly taught in introductory computing theory courses. These models have …

Programming problems are commonly used as a learning and assessment activity for
learning to program. We believe that programming problems can be effective for broader …

With the rapid transition to distance learning, automatic grading software becomes more
important to both teachers and students. We study the problem of automatically grading the …

Software tools and apps are pervading educational technology in many areas, not least in
the field of computer science education. However, many of these tools have a very narrow …

Развитие методов генерации учебных заданий и их классификации для применения в
учебном процессе позволило реализовать интеллектуальную обучающую систему …