current paper cs402 file 1 23 june spring 2018

cs 402

 80% from last 10 lecs some mcqs from moaaz file 
  1. make transition table of FA1 and FA2 ,two digrams are given 
  2. one diagram given write language which accept this diagram also write regular expression
  3. define recursive language of L where b must one on sigma={a,b} like that questions comes in my today paper


Don't Forget To Join My FB Group VU Vicky

  1. please upload the gdb of cs402! details are given below...
    Dear Students,

    Graded discussion (GDB) will be launched on Thursday 9th August, 2018 and it will remain open for two days. You can post your comments on the below mentioned topic till Friday 10th August, 2018.

    Theory of automata is the study of abstract machines, as well as learning of computational problems that can be solved using them. It is a theory in theoretical computer science and discrete mathematics (a subject of study in both mathematics and computer science). It is considered to be the study of machines like Turing machine, Finite state machine, Pushdown Automata etc. By keeping in mind the concepts of automata, you have to elaborate the role of Push down Automata (PDA) and Turing Machine in Formal Language Processing and which one is better in both to them? Justify your answer with proper reason.

    A concise and to the point comment is preferred over lengthy comments having irrelevant details. Your comment must not be more than 5-6 lines. Comments, posted on regular Lesson's MDB or sent through email will NOT be considered in any case. For any queries please email at

    Good Luck!


Post a Comment

Don't Forget To Join My FB Group VU Vicky

Previous Post Next Post