| 000 | 02661nam a22003253a 4500 | ||
|---|---|---|---|
| 001 | UPMIN-00003211646 | ||
| 003 | UPMIN | ||
| 005 | 20221108165003.0 | ||
| 008 | 221108b |||||||| |||| 00| 0 eng d | ||
| 040 |
_aDLC _cUPMin _dupmin |
||
| 041 | _aeng | ||
| 090 | 0 |
_aLG993.5 2008 _bC6 S25 |
|
| 100 | _aSanchez, Trextan Thaddeus B. | ||
| 245 | 2 |
_aA Java based finite automation source code generator / _cTrextan Thaddeus B. Sanchez. |
|
| 260 | _c2008 | ||
| 300 | _a91 leaves | ||
| 502 | _aThesis (BS Computer Science) -- University of the Philippines Mindanao, 2008 | ||
| 520 | 3 | _aMany of us use machines in our daily lives. They were designed to help us in our endeavors. Some examples are the washing machines, ATMs, the Google search engine and many more. In order to understand how they work, the concept of Automata theory must be first understood. Automata theory deals with the definitions and properties of mathematical models of computation. Strings and symbols are used as models for representing data that computers manipulate. A finite automation or a finite state machine represents a simple model of a computer. It is normally considered as a language recognition device. This is what the programs in the machines consist of. In the case of the search engine of the Google, the user inputs string/s of word/s, then the program in Google scans all items in their database. Finite state machines can be translated as codes in programs. Following the state diagrams, a program can be constructed in a straightforward manner using switch statement. This study aims to create a java program that will itself create another java program which is the concrete representation of a particular finite automation. This java program can be used to create such machines mentioned earlier. The system was implemented using Java Netbeans version 5.5 with JDK version 1.6. the system can be run in Linux and in Windows XP for these are the ones that the author used to generate and test the system. After implementation, this study was able to produce a system that can instantly generates codes that can be used in different automated machines with respect to a finite automation input. Also, the proponent was able to formulate algorithms that will help in generating codes | |
| 650 | 1 | 7 | _aAutomata theory. |
| 650 | 1 | 7 | _aFinite automaton. |
| 650 | 1 | 7 | _aFinite state machines. |
| 650 | 1 | 7 | _agetting dead ends. |
| 650 | 1 | 7 | _aGetting new final states. |
| 650 | 1 | 7 | _aSource code generator. |
| 650 | 1 | 7 | _aFinite automaton to source code. |
| 658 |
_aUndergraduate Thesis _cCMSC200, _2BSCS |
||
| 905 | _aFi | ||
| 905 | _aUP | ||
| 942 |
_2lcc _cTHESIS |
||
| 999 |
_c2240 _d2240 |
||