Show simple item record

dc.contributor.advisorChairperson, Graduate Committee: Rockford Rossen
dc.contributor.authorMerryman, William Patricken
dc.date.accessioned2013-06-25T18:44:05Z
dc.date.available2013-06-25T18:44:05Z
dc.date.issued2007en
dc.identifier.urihttps://scholarworks.montana.edu/xmlui/handle/1/1864en
dc.description.abstractMany students may find the conversion of non-deterministic finite state automata into deterministic finite state automata to be difficult. Since standard computers are deterministic by nature, it is beneficial to understand how to convert nondeterministic finite state automata into equivalent deterministic versions. This conversion process is often inadequately presented in traditional textbooks, though, as static presentations rarely capture the dynamics of the process. This thesis provides a Java applet that will help students better understand the conversion, and may help teachers to better present the conversion. This applet was designed to be beneficial to student learning; therefore, many different learning modes were included.en
dc.description.abstractThese modes vary the speed and level of detail of the conversion so that students may proceed at their own pace. Each step of the conversion is animated and the student is constantly made aware of what has just happened and what is going to happen next, along with how the step will be performed. If the student is asked by the applet to supply anything, the applet will provide the student with feedback on his or her mistakes or successes. This non-deterministic finite state automaton to deterministic finite state automaton conversion applet will be added to the Webworks hypertextbook project. This project is designed around the premise that animating algorithms will lead to better learning.en
dc.language.isoenen
dc.publisherMontana State University - Bozeman, College of Engineeringen
dc.subject.lcshMachine theory.en
dc.subject.lcshRobots.en
dc.subject.lcshAlgorithms.en
dc.titleAnimating the conversion of nondeterministic finite state automata to deterministic finite state automataen
dc.typeThesisen
dc.rights.holderCopyright 2007 by William Patrick Merrymanen
thesis.catalog.ckey1286558en
thesis.degree.committeemembersMembers, Graduate Committee: Year-Back Yoo; Rafal Angryken
thesis.degree.departmentComputer Science.en
thesis.degree.genreThesisen
thesis.degree.nameMSen
thesis.format.extentfirstpage1en
thesis.format.extentlastpage51en
mus.data.thumbpage22en


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record