MARC details
000 -LEADER |
fixed length control field |
02661nam a22003253a 4500 |
001 - CONTROL NUMBER |
control field |
UPMIN-00003211646 |
003 - CONTROL NUMBER IDENTIFIER |
control field |
UPMIN |
005 - DATE AND TIME OF LATEST TRANSACTION |
control field |
20221108165003.0 |
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
fixed length control field |
221108b |||||||| |||| 00| 0 eng d |
040 ## - CATALOGING SOURCE |
Original cataloging agency |
DLC |
Transcribing agency |
UPMin |
Modifying agency |
upmin |
041 ## - LANGUAGE CODE |
Language code of text/sound track or separate title |
eng |
090 #0 - LOCALLY ASSIGNED LC-TYPE CALL NUMBER (OCLC); LOCAL CALL NUMBER (RLIN) |
Classification number (OCLC) (R) ; Classification number, CALL (RLIN) (NR) |
LG993.5 2008 |
Local cutter number (OCLC) ; Book number/undivided call number, CALL (RLIN) |
C6 S25 |
100 ## - MAIN ENTRY--PERSONAL NAME |
Personal name |
Sanchez, Trextan Thaddeus B. |
245 #2 - TITLE STATEMENT |
Title |
A Java based finite automation source code generator / |
Statement of responsibility, etc. |
Trextan Thaddeus B. Sanchez. |
260 ## - PUBLICATION, DISTRIBUTION, ETC. |
Date of publication, distribution, etc. |
2008 |
300 ## - PHYSICAL DESCRIPTION |
Extent |
91 leaves |
502 ## - DISSERTATION NOTE |
Dissertation note |
Thesis (BS Computer Science) -- University of the Philippines Mindanao, 2008 |
520 3# - SUMMARY, ETC. |
Summary, etc. |
Many 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 17 - SUBJECT ADDED ENTRY--TOPICAL TERM |
Topical term or geographic name entry element |
Automata theory. |
650 17 - SUBJECT ADDED ENTRY--TOPICAL TERM |
Topical term or geographic name entry element |
Finite automaton. |
650 17 - SUBJECT ADDED ENTRY--TOPICAL TERM |
Topical term or geographic name entry element |
Finite state machines. |
650 17 - SUBJECT ADDED ENTRY--TOPICAL TERM |
Topical term or geographic name entry element |
getting dead ends. |
650 17 - SUBJECT ADDED ENTRY--TOPICAL TERM |
Topical term or geographic name entry element |
Getting new final states. |
650 17 - SUBJECT ADDED ENTRY--TOPICAL TERM |
Topical term or geographic name entry element |
Source code generator. |
650 17 - SUBJECT ADDED ENTRY--TOPICAL TERM |
Topical term or geographic name entry element |
Finite automaton to source code. |
658 ## - INDEX TERM--CURRICULUM OBJECTIVE |
Main curriculum objective |
Undergraduate Thesis |
Curriculum code |
CMSC200, |
Source of term or code |
BSCS |
905 ## - LOCAL DATA ELEMENT E, LDE (RLIN) |
a |
Fi |
905 ## - LOCAL DATA ELEMENT E, LDE (RLIN) |
a |
UP |
942 ## - ADDED ENTRY ELEMENTS (KOHA) |
Source of classification or shelving scheme |
Library of Congress Classification |
Koha item type |
Thesis |