| Ideal Level | Standard Level | Minimal Level |
Achievement 1 | Enable to explain relationship between formal languages and automata, and apply it to problem solving. | Enable to explain relationship between formal languages and automata. | Enable to explain concept of formal language. |
Achievement 2 | Enable to classfy formal languages according to number of restrictions and apply to problem solving. | Enable to classfy formal languages according to number of restrictions. | Enable to explain that formal languages are categorized according to number of restrictions. |
Achievement 3 | Enable to explain concept of automaton based on state transition diagram and apply it to problem solving. | Enable to explain concept of automaton based on state transition diagram. | Enable to explain concept of automaton. |
Achievement 4 | Enable to explain relationship between regular expressions and finite automata with specific examples, and apply them to problem solving. | Enable to explain relationship between regular expressions and finite automata with specific examples. | Enable to explain relationship between regular expressions and finite automata. |
Achievement 5 | Enable to explain roles and mechanisms of compilers with specific examples, and apply them to problem solving. | Enable to explain roles and mechanisms of compilers with specific examples. | Enable to explain roles and mechanisms of compilers. |