Simplication of Context Free Grammar And Testing for Membership

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 Field	Value	Language
dc.contributor.author	Benig, Azenith Ann A.	-
dc.date.accessioned	2024-07-03T00:14:40Z	-
dc.date.available	2024-07-03T00:14:40Z	-
dc.date.issued	2003-04	-
dc.identifier.uri	http://dspace.cas.upm.edu.ph:8080/xmlui/handle/123456789/2720	-
dc.description.abstract	A 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.title	Simplication of Context Free Grammar And Testing for Membership	en_US
dc.type	Thesis	en_US
Appears in Collections:	Computer Science SP

Files in This Item:

File	Description	Size	Format
CS12.pdf Until 9999-01-01		44.13 MB	Adobe PDF	View/Open Request a copy

DSpace JSPUI