Cabrales, John Paul S.
Regular expression to dfa generator - Cebu City CIT-U 2006
Cabrales,John Paul., Lascuña, Beverlyn B., Paragados, Maxima Q.; College of Computer Studies, Cebu Institute of Technology; Date: March 11, 2006; Title: Transition Table to DFA Generator.
The regular expression to DFA Generator is a software program that would generate Determistic Finite Automata (DFA) based on a given regular expression. However, as this main goal was not realized, the proponents were only able to create a Transition table to DFA Maker, basing the DFA from the data inputted in the transition table. The idea behind is based from Automata and Language Theory. It also checks if a given Regular Expression (RE) is valid and if a given string is acceptable given the inputted RE. After taking the subject Automata and Language Theory, the group has decided to make a machine that would aid the user to a fast, reliable and accurate way of generating DFA, thus developing this project.
The final DFA Generator we have come up has certain limitations. Transitions were achieved by drawing an upward or downward arc to signify the direction rather an arrow. An upward arc signifies a left-to-right transition, while a downward arc signifies right-to-left. With these, the group recommends that the software be improved by future proponents in the following aspects:
The transition would be better if its an arrow because it has direction.
The R.E. to DFA generation would be realized.
The union sign (+) would be supported
The number of state will not limit up to 8.
The number of input alphabets would not limit up to
The frame size could be minimized or maximized.
T C1127 2006
Regular expression to dfa generator - Cebu City CIT-U 2006
Cabrales,John Paul., Lascuña, Beverlyn B., Paragados, Maxima Q.; College of Computer Studies, Cebu Institute of Technology; Date: March 11, 2006; Title: Transition Table to DFA Generator.
The regular expression to DFA Generator is a software program that would generate Determistic Finite Automata (DFA) based on a given regular expression. However, as this main goal was not realized, the proponents were only able to create a Transition table to DFA Maker, basing the DFA from the data inputted in the transition table. The idea behind is based from Automata and Language Theory. It also checks if a given Regular Expression (RE) is valid and if a given string is acceptable given the inputted RE. After taking the subject Automata and Language Theory, the group has decided to make a machine that would aid the user to a fast, reliable and accurate way of generating DFA, thus developing this project.
The final DFA Generator we have come up has certain limitations. Transitions were achieved by drawing an upward or downward arc to signify the direction rather an arrow. An upward arc signifies a left-to-right transition, while a downward arc signifies right-to-left. With these, the group recommends that the software be improved by future proponents in the following aspects:
The transition would be better if its an arrow because it has direction.
The R.E. to DFA generation would be realized.
The union sign (+) would be supported
The number of state will not limit up to 8.
The number of input alphabets would not limit up to
The frame size could be minimized or maximized.
T C1127 2006