Skip Navigation

Scholars Day 2007, Wednesday, April 11

Incorporating Transformation into JFLAP for Enhanced Understanding of Automata Theory

Automata Theory is a prominent study in the field of Computer Science in which machines, or automata, are used to manipulate symbols performing some kind of computation. Each automaton has a set of finite states that represent memory, and a set of transition rules to move between those states. When given some input set of symbols, an automaton can process the input and produce a result that can range from accepting or rejecting the input, a mathematical operation, or formulated output. If one were to change the states and transition rules, a machine can be transformed into a completely different machine. Currently, there is an open-source program to teach and simulate automata called JFLAP. By incorporating transformations into the JFLAP program, examples of how an automaton can be manipulated with other programs will be displayed.

Presenter: Jonathan Jarvis (Undergraduate Student)
Topic: Computer Science
Location: 204 Holmes
Time: 10:45 am (Session II)