Showing posts with label turing machine. Show all posts
Showing posts with label turing machine. Show all posts

Saturday, January 17, 2015

Quiz on Theory of Computation

1.   Which string is not accepted by the following FSA?
                               
      a. 00110                b. 01010                      c. 11010                                           d. 00111
2.   Consider the following language L = {anbn|n ≥ 1} then  L is
      a.  regular              b. CSL but not CFL                c.  CFL but not regular        d. type 0 language but not type 1

Search Aptipedia