Skip to main content
Article thumbnail
Location of Repository

Graphical Simulation of Finite Automata

By Roman Šrajer


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

Topics: Java Web Start; Java; simulace; awt.; finite state machine; Regular expression; konečný automat; swing; Regulární výraz; simulation
Publisher: Vysoké učení technické v Brně. Fakulta informačních technologií
Year: 2009
OAI identifier:
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.