Vysoké učení technické v Brně. Fakulta informačních technologií
Abstract
This Bachelor's Thesis is about the theory of converting regular expression to finate state machine and vice versa. The goal of practical part is to make web application that performs these coversions and do simulation for input string. For converting automata into regular expression it is used the algebraic method which is based on making an equation system to be solved. I have chosen Java as programming language and Java Applet and Java Web Start as technologies that make possible to access the application through the web page. The possibilities like working with three types of automata views, saving atomatons into XML and intuitively creating own automatons are the important part of the application
Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.