Theory of Computing Homework 8 CS 3810, Fall 2009 Due Friday, October 30 General guidelines: You may work with other people, as long as you write up your solution in your own words and understand everything you turn in. Make sure to justify your answers—they should be clear and concise, with no irrelevant information. Each problem should be submitted on a separate piece of paper. Please put your netid on your homework! 1. Construct a one state pda that accepts the context-free language by empty store generated by the following grammar. ||||SaSb B CBbBbCCcc→→→2. Describe in one paragraph how to go from a one state pda that accepts by empty store
This is the end of the preview.
access the rest of the document.
Formal languages, Context-free grammar, context-free language, Theory of Computing, following multi-state pda