Multimedia learning machine based on non-deterministic finite automaton

With the increasing international communications, people are eager to learn foreign languages. As an auxiliary tool, multimedia learning machine (MLM) is welcomed by foreign language learners. So, it is very necessary to design a powerful MLM efficiently. How to deal with the state transition of MLM´s different states is a key issue. In this paper, we describe a solution to design a MLM based on non-deterministic finite automaton (MLM-NFA) and present in detail the state transition model, state transition diagram and the core algorithm. The finite automaton helps us distinguish clearly the relation of state transitions of MLM and the mapping between MLM states and buttons in MLM user interfaces. The MLM-NFA has many advanced functions, such as point-to-read, A-B repeating and role playing. At the end of the paper, we implement an MLM-NFA which proves that the model based on non-deterministic finite automaton principle is quite efficient in practice and makes it very simple and flexible in development.