TCS with Kamal Sir

May 2023 10m Q4b Applications of FA PDA and TM

May 2023 10m Q3b Pumping Lemma for wcwr

May 2023 10m Q4a construct CFG for the following

May 2023 10m Q5A DESIGN MOORE MACHINE TO CONVERT EACH OCCURENCE OF 100 TO 101 CONVERT INTO MEAL

May 2023 Q5b / 10M TM for palindromes

May 2023 Q3a /10M PDA for a^nb^mc^n

May 2023 Q1A / 5M show that grammar is ambiguous

Q3B Write a regular expresion on {0,1} May 2023 10M

Q3A Using following grammar LMD and RMD May 2023 10m

Q2B DESIGN Finite Automata which accept the string which ends with bba or abb MAY 2023 10M

Q2A MOORE MACHINE TO CONVERT EACH OCCURENCE OF 120 TO 122 CONVERT INTO MEALY MACHINE MAY 2023 10M

Q4B Design PDA to accept a language L = { an 1b2n+1 n = 1} May 2023 10M

Q4A Design TM to recognize L = {anbn n = 1} MAY 2023 10M

Q5B Convert the following grammar to GNF May 2023 10M

Q5A Give and explain formal definition of pumping lemma for regular language May 2023 10M

Q6 D Explain any 5 variants of Turing Machine May 2023 10M

Q6 A Explain PCP with an example MAY 2023 10M

Q1D EXPLAIN RECURSIVE AND RECURSIVELY ENUMERABLE LANGUAGE MAY 2023 5M

Q1C DIFFERENCE BETWEEN MOORE AND MEALY MACHINE MAY 2023 5M

Q1B DIFFERENTIATE BETWEEN NFA AND DFA MAY 2023 5M

Q1A WRITE SHORT NOT ON CHOMSKY HIERARCHY ON GRAMMAR MAY 2023 5M

Q5B PUMPING LEMMA FOR REGULAR LANGUAGE NOV 2022 10M

Q3B TM FOR WELL FORMEDNESS OF PARENTHESIS NOV 2022 10M

Q1C EXPLAIN VARIANTS OF TURING MACHINE NOV 22 5M

Q6D DEFN AND WORKING OF PDA NOV 2022 10M

Q3A PDA FOR A2NBN NOV 2022 10M

Q6A CHOMSKY HIERARCHY NOV 2022 10M

Q4B DERIVATION FOR IF ELSE AND CHECK IF ITS AMBIGUOUS NOV 2022 10M

Q2B GREIBACH NORMAL FORM NOV 2022 10M

Q1D SHOW THAT GRAMMAR IS AMBIGUOUS NOV 22 5M