A java-based visualization software that verifies the Kleene's theorem / (Record no. 526)
[ view plain ]
000 -LEADER | |
---|---|
fixed length control field | 02002nam a2200241 4500 |
001 - CONTROL NUMBER | |
control field | UPMIN-00000010890 |
003 - CONTROL NUMBER IDENTIFIER | |
control field | UPMIN |
005 - DATE AND TIME OF LATEST TRANSACTION | |
control field | 20221013164329.0 |
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
fixed length control field | 221013b |||||||| |||| 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 ## - LOCALLY ASSIGNED LC-TYPE CALL NUMBER (OCLC); LOCAL CALL NUMBER (RLIN) | |
Classification number (OCLC) (R) ; Classification number, CALL (RLIN) (NR) | LG993.5 2000 |
Local cutter number (OCLC) ; Book number/undivided call number, CALL (RLIN) | C6 D46 |
100 1# - MAIN ENTRY--PERSONAL NAME | |
Personal name | Depasucat, Chat Sandoval. |
245 00 - TITLE STATEMENT | |
Title | A java-based visualization software that verifies the Kleene's theorem / |
Statement of responsibility, etc. | Chat Sandoval Depasucat |
260 ## - PUBLICATION, DISTRIBUTION, ETC. | |
Date of publication, distribution, etc. | 2000 |
300 ## - PHYSICAL DESCRIPTION | |
Extent | 88 leaves. |
502 ## - DISSERTATION NOTE | |
Dissertation note | Thesis (BS Computer Science) -- University of the Philippines Mindanao, 2000 |
520 3# - SUMMARY, ETC. | |
Summary, etc. | The developed software entitled ?Java-based Visualization software that Verifies the Kleene?s Theorem? automates the proofs presented in Kleene?s Theorem. Kleene theorem shows the equivalence of the three language-defining methods, the regular expression, finite automata and transition graph. These are mathematical models which represent the different levels of abstraction of computer systems and serve as simplifications at how some actual machines work. The software converts a finite automation to regular expression, generates closure of a finite automation, concatenates two finite automata and unifies two finite automata. For the conversion of a finite automation to regular expression, a step by step visualization can be generated, while visual representations of the initial and resulting finite automata can be generated for the other applications. The software allows interactive creation of the initial finite automata. The users are asked for the specifications of the finite automata they intend to create, the number of states, the final state/s and the connections of the states. This software will aid computer science educators in presenting the concept of Kleene?s theorem. Students will be assured of efficient implementation of the proofs of the Kleene?s theorem as well |
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 |
Withdrawn status | Lost status | Source of classification or shelving scheme | Damaged status | Status | Collection | Home library | Current library | Shelving location | Date acquired | Accession Number | Total Checkouts | Full call number | Barcode | Date last seen | Price effective from | Koha item type |
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Library of Congress Classification | Not For Loan | Preservation Copy | University Library | University Library | Archives and Records | 2022-09-21 | UAR-T-gd737 | LG993.5 2000 C6 D46 | 3UPML00021985 | 2022-09-21 | 2022-09-21 | Thesis | ||||
Library of Congress Classification | Not For Loan | College of Science and Mathematics | University Library | General Reference | 2006-06-27 | CSM-T-gd1422 | LG993.5 2006 C6 D46/ | 3UPML00011621 | 2022-09-21 | 2022-09-21 | Thesis |