CS311 Quiz #5 ........ YourName_________________________

#1.

(a) Convert the following regular grammar to an FA. 
   S -> aA | bC | b
   A -> aS | bB
   B -> aC | bA |a
   C -> aB | bS

`   
`    
`   
`
(b) Find a regular grammar generating the FA.
`   
`    
`   
`

#2

(a) Describe the language generated by the grammar
S -> ASb | Λ
A -> Λ | a | aa 
`   
`    
`   
`
(b) Find a CFG for strings in {0,1}* representing (binary) numbers larger than 4 (= "100").