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: | , , , |
|---|---|
| Format: | text |
| Published: |
Animo Repository
2018
|
| Subjects: | |
| Online Access: | https://animorepository.dlsu.edu.ph/faculty_research/12721 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | De La Salle University |