6b: Finite State Machines
Academic Year 2019-2020
Deterministic Finite Automata (DFA) are models of computers with limited amount of memory.
They typically serve as a starting point in undergraduate theory courses.
However, they are ubiquotous and have applications in many different areas
such as sequential logic cirucit design, neural networks, markov chains and
lexical analyzers. Here, we test the ability of students to design a DFA
to recognize a specified language.
Assessment is performed as follows.
|