Agathe Merceron
Abstract
Deterministic finite automata (DFA) are taught in courses like "formal foundations of computer science". It is quite a challenge to get students interested and proficient in that field. This contribution presents a set of design patterns to help teachers teach and students learn the design of DFA.
OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Deterministic finite automata (DFA) are taught in courses like "formal foundations of computer science". It is quite a challenge to get students interested and proficient in that field. This contribution presents a set of design patterns to help teachers teach and students learn the design of DFA.
Key concepts: Computer science, Automaton, Automata theory, Deterministic finite automaton, Field (mathematics), Set (abstract data type), Theoretical computer science, Learning automata