Development of converted deterministic finite automation of decision tree rules of student graduation and adaptive learning environment
In theory of computation, a deterministic finite automaton (DFA) is a finite state machine that accepts/rejects finite strings of symbols and only produces a unique computation. This study aims to convert the extracted decision tree rules sets from decision tree algorithm and the learning path seque...
Saved in:
| Main Authors: | , , , |
|---|---|
| 格式: | text |
| 出版: |
Animo Repository
2018
|
| 主題: | |
| 在線閱讀: | https://animorepository.dlsu.edu.ph/faculty_research/12721 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 機構: | De La Salle University |