Filling out the Study Plan Card is an obligatory activity for active students at a university. The number of courses and there are conditions in the taker is a common thing among students, but did not rule out that there are still many students who are wrong in taking the course so that the denied access to a course because there are compulsory courses that have not been taken. This paper discusses how Finite State Automata method of NFA type can be implemented in filling out the study plan card (KRS). With the implementation of this method, the user is expected to be helpful in filling out the study plan card and can better understand how the process of filling out the study plan card is correct.