Scribd Logo
Upload

Welcome to Scribd!

  • 103 views

    CSE 355 Theory of Computing ID: - Spring 2012 - Colbourn Midterm # 2 Page 1 of 6: $:89

    Uploaded by

    Cameron Harman
    (1) This document is the midterm exam for CSE 355 Theory of Computing taught by Professor Colbourn in Spring 2012. (2) The exam contains 6 questions about grammars, languages, and properties of strings. Students are instructed to write all answers on the exam paper and that computers, calculators, and communication devices are forbidden. (3) The questions involve determining whether strings are in languages generated by given grammars, finding unit productions in grammars, and determining whether start variables are recursive.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    CSE 355 Theory of Computing ID: - Spring 2012 - Colbourn Midterm # 2 Page 1 of 6: $:89

    Uploaded by

    Cameron Harman
    103 views5 pages
    (1) This document is the midterm exam for CSE 355 Theory of Computing taught by Professor Colbourn in Spring 2012. (2) The exam contains 6 questions about grammars, languages, and properties of strings. Students are instructed to write all answers on the exam paper and that computers, calculators, and communication devices are forbidden. (3) The questions involve determining whether strings are in languages generated by given grammars, finding unit productions in grammars, and determining whether start variables are recursive.

    Original Title

    355mt2s12sol.pdf

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    (1) This document is the midterm exam for CSE 355 Theory of Computing taught by Professor Colbourn in Spring 2012. (2) The exam contains 6 questions about grammars, languages, and properties of strings. Students are instructed to write all answers on the exam paper and that computers, calculators, and communication devices are forbidden. (3) The questions involve determining whether strings are in languages generated by given grammars, finding unit productions in grammars, and determining whether start variables are recursive.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    103 views5 pages

    CSE 355 Theory of Computing ID: - Spring 2012 - Colbourn Midterm # 2 Page 1 of 6: $:89

    Uploaded by

    Cameron Harman
    (1) This document is the midterm exam for CSE 355 Theory of Computing taught by Professor Colbourn in Spring 2012. (2) The exam contains 6 questions about grammars, languages, and properties of strings. Students are instructed to write all answers on the exam paper and that computers, calculators, and communication devices are forbidden. (3) The questions involve determining whether strings are in languages generated by given grammars, finding unit productions in grammars, and determining whether start variables are recursive.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 5

    CSE 355

    Spring 2012 - Colbourn

    Theory of Computing
    Midterm # 2

    
    
    
    

    ID: ___________
    Page 1 of 6

    :=
    $:89:

    

    "

     

    
    
    

    !'(! !'$ 9< '&%&!!"&&*/! !&!" &*' &


     %&$'&&!!%!/ !&% &*&%$"$&&/!"'&$%-'&!$%- !' &! 
    (%$  /$& %)$%! &* &! ""$&%/ 
    
     ,  
    
    
     

    

     

    

     

    

     

    

     

    

     

    

    ! '%#'%&! 39$4. *"! ' 167&&% !&! &*&0


    $%
       

    '%&! 9/398$%&!&4
    12 3;$%4(! &*&0$$$ !%+ !$!$!$5)).
    ) 5-676/1)%&$($%!)/2
    
    
    
    
    
     
       
     
     

    CSE 355
    Spring 2012 - Colbourn

    Theory of Computing
    Midterm # 2

    ID: ___________
    Page 2 of 6

    
    $% &/' 1((  )*!$%$%0 $%)"$$%  
          "%   #    
         
     #
      
      "
    0
    00000
    0
    0
    
    "#"$!##%!(!"#*##!-"
     !(&!*##"("(!!,
    
     ."&-,'
     1((  )*! $%$%$%)"  #     
    
            "
    $" $ #"&## " #'#1!,""$3###!!(4
    ###"*# #" $ "##,
    #&:   2###&" 0&0"#"# , &&!#&:$%'()&#
    0%'(0 ,$"%'("##"# *##"###
    *##"###,
    "8+%(#"!$#,$%9'(9)#!"!-"#-"
    !!-"#-"*"# *#!#,
    "9+%(#",$%7'(7)"!-"#-"*"# *
    #!#,
    $#%("# #(*"&%#!##"","#!&#
    $ * "#,
    
    ($ "#!###"
    -"#-"!-"*#&("
    $ *"##&-###!"$###($&#,
    """&#!#!$##!56$"!"
    ($
     $ &,#"######"."!/"#$*#
    "######"#."/"!!#,

    CSE 355
    Spring 2012 - Colbourn

    Theory of Computing
    Midterm # 2

    ID: ___________
    Page 3 of 6

    %#$ 7254"#$ $3 $$""'$!" %$ #


    
    ...
    
    ...
    ..
    .
    
    ..
    ...
    01 28"#3&"# "%*%###*"%"#&*
    " %*#-  ###*#-  %"#&*#- 
    
     
    
     
    
     
    
     
    
    
    
     
    
     
      
       
    
    
          
    
    
          
    
     
    
     
    
    01 28"#3
    )$""# $$051$#$"$&"# $
    "%"#&+061$"" /!" %$ #(!$! ##)+071
    $"" %$!" %$ #,
       
     
    

     
      
     
      
    
     
     
     

         


          !  

     
     
        
    
     
       
      
     
    
    
     
     
      
    

      

     
      
      
      
      
      
     
      
     
      
      
      
      
      
     
     
     
      
      
      
      
     
    
    
     
     
      
    

        

    CSE 355
    Spring 2012 - Colbourn

    Theory of Computing
    Midterm # 2

    ID: ___________
    Page 4 of 6

     )#('
    $ *% 
     +'&        
     
    
    
     
    
      ! 
      
    
      
    
    
    
    
    
    
     
       "
    
    !$    & &( /(
    !$"   ) )( 0(
    !$"   ) )( 1(
     /&0& 1(
    
    
     !  %(
     
    /'  ,.&/-&.  &/*$+  (
    *.&&+2,*.&+-*&&+2* &%& +&*&%&+&*&%&+&* & & +&* && +&*&&+&
    *& &+&*&&+& *&&+(
    *.&&+2,*/&+-*&&+2* && +&*& &+& *&&+(
    */&&+2,*/&+-&, &&-(
    
     
    0'  ,.&/-&.  &/*$+  (
    *.&&+2,*.&+-*&&+2* &%& %+&* & & +&* &&+&*& & +&*&%&%+&*&&+&
    *&%&%+&*& &+&*&&+
    *.&&+2,*/&+-2 &(
    
     
    1'  ,.&/-&.  &/*$+  (
    *.&&+2,*.&+-*&&+2* &%& %+&* & & +&* &&+&*& & +&*&%&%+&*&&+&
    *&%&%+&*& &+&*&&+
    *.&&+2,*/&+-2 &(
    
    
    '  ,.&.&/&.&/&.&/-&.  & 
    ,/&/&/-   (    ! "
    *.&&%+2,*.&%+&*.&%+&*.&%+-(
    
           (
     
    # $   (

    CSE 355
    Spring 2012 - Colbourn

    Theory of Computing
    Midterm # 2

    ID: ___________
    Page 5 of 6

     "   !#*"&!("!*' +


    !"#!(!#' #%*##("-"&!)
    
    !  
    
    
    "!"$! #*$#
    "!#0++*"$"#41+
    #!$"#
    ##"#
    +
    
     !   
    
    23"$#( $ #"#!$!+#"
    ##"#
    !$!+
    
    
    !    
    
    $"!$"#"!!!+%!(!!!"
    #'#/!!!"&+%!(!$"
    +
    
     !   
    
    $ !#"""
    $"#""(0
    .01.1+$#(# $ !!$"*##
    $ "#" !+
    
     !      
    
    %!(#$"!$!0#,""(#!#1+%!(!$!
    $"!#/!!!+%!(!#/!!!"!
    !!+%!(#$"!+
    
    ###$"!!##"#!" ##
    #$"#!) ("#!!!!#"!+

    You might also like