Thesis (BS Computer Science) -- University of the Philippines Mindanao, 2000

The developed software entitled ?Java-based Visualization software that Verifies the Kleene?s Theorem? automates the proofs presented in Kleene?s Theorem. Kleene theorem shows the equivalence of the three language-defining methods, the regular expression, finite automata and transition graph. These are mathematical models which represent the different levels of abstraction of computer systems and serve as simplifications at how some actual machines work. The software converts a finite automation to regular expression, generates closure of a finite automation, concatenates two finite automata and unifies two finite automata. For the conversion of a finite automation to regular expression, a step by step visualization can be generated, while visual representations of the initial and resulting finite automata can be generated for the other applications. The software allows interactive creation of the initial finite automata. The users are asked for the specifications of the finite automata they intend to create, the number of states, the final state/s and the connections of the states. This software will aid computer science educators in presenting the concept of Kleene?s theorem. Students will be assured of efficient implementation of the proofs of the Kleene?s theorem as well