Please use this identifier to cite or link to this item: http://dspace.cas.upm.edu.ph:8080/xmlui/handle/123456789/2720
Full metadata record
DC FieldValueLanguage
dc.contributor.authorBenig, Azenith Ann A.-
dc.date.accessioned2024-07-03T00:14:40Z-
dc.date.available2024-07-03T00:14:40Z-
dc.date.issued2003-04-
dc.identifier.urihttp://dspace.cas.upm.edu.ph:8080/xmlui/handle/123456789/2720-
dc.description.abstractA software is developed to aid the students on understanding some of the theories in Automata and Language Theory course. Specifically, this Special Problem is developed to demonstrate simplification of Context Free grammars and testing for membership of a given string/word satisfying the grammar rules. This also shows the strings that can be generated by a finite type of grammar. Helpful information regarding the basic concepts and steps being taken are provided while executing the simulation of simplifying Context Free Grammars and a testing a string if it can be generated by the inserted grammar.en_US
dc.titleSimplication of Context Free Grammar And Testing for Membershipen_US
dc.typeThesisen_US
Appears in Collections:Computer Science SP

Files in This Item:
File Description SizeFormat 
CS12.pdf
  Until 9999-01-01
44.13 MBAdobe PDFView/Open Request a copy


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.