PROLOG -> PROGRAM 3

 BIRYINI IS A FOOD.

MOMO IS A FOOD.

BIRIYANI IS A LUNCH.

QUESTION:? 

A) WHICH ITEMS ARE IN LUNCH?

PROLOG -> PROGRAM 2

 BIRYINI IS A FOOD.

MOMO IS A FOOD.

QUESTION:? 

A) HOW MANY FOODS?

B) IF ALL FOODS ARE MEAL , THEN DISPLAY ALL MEALS.

PROLOG -> PROGRAM 1

 

1. BIRYINI IS A FOOD.

QUESTION:? 

A) IS BIRIYANI A FOOD?

B) IS MOMO  A FOOD?

8. If L is a context-free language, then we can construct a pda A accepting L by empty store, i.e. L = N(A).

 8. If L is a context-free language, then we can construct a pda  A accepting L by empty store, i.e. L = N(A).

7. Construct a pda A accepting the set of all strings over {a, b} with equal number of a's and b's.

 7. Construct a pda A accepting the set of all strings over {a, b} with equal  number of a's and b's.

Construct a pda A accepting L = {WCWT } by final state.

 Construct a pda A accepting L = {WCW^T } by final state. 

5. deterministic pda

 5. deterministic pda

4. move of pushdown automaton.

 4. move of  pushdown automaton. 

3. instantaneous description (ID) of pushdown automaton.

 3. instantaneous description (ID) of pushdown automaton.

III ) Design a TM that accepts {0N1N: n >=1}.

  III )  Design a TM that accepts {0^N1^N: n >=1}.

Design a Turing machine over {I. b} which can compute a concatenation function over L = {I}. If a pair of words (W1,W2) is the input. the output has to be W1.W2.

 Design a Turing machine over {I. b} which can compute a concatenation function over L = {I}. If a pair of words (W1,W2) is the input. the output has to be W1.W2.

2. Definition - pushdown automaton.

 2. Definition -  pushdown automaton.

1. Model of a pushdown automaton.

 1. Model of a pushdown automaton.

NUMERICAL ANALYSIS CLASS LAB CLASS - 1

5. DESIGN OF TURING MACHINES -

 I )  Design a Turing machine to recognize all stlings consisting of an even number

             of 1's.

4. INPUT PROCESSING USING ID.

 4. INPUT PROCESSING USING ID.

3. MOVES OF TURING MACHINE USING ID.

 3. MOVES OF TURING MACHINE USING ID.

2. REPRESENTATION OF TURING MACHINE.

 

1. DEFINITION TURING MACHINE .

 1. DEFINITION TURING MACHINE . 

question theory of automata from Mishra CHAPTER 9

 1. DEFINITION TURING MACHINE .  ANSWER LINK  + 

2. REPRESENTATION OF TURING MACHINE.  ANSWER LINK

3. MOVES OF TURING MACHINE USING ID.  ANSWER LINK + 

4. INPUT PROCESSING USING ID.  ANSWER LINK

5. DESIGN OF TURING MACHINES - 

         I )  Design a Turing machine to recognize all stlings consisting of an even number

             of 1's. ANSWER LINK + 

        II )  Design a Turing machine over {I. b} which can compute a concatenation

              function over L = {I}. If a pair of words (W1,W2) is the input. the output has

              to be W1.W2. ANSWER LINK

      III )  Design a TM that accepts {0^N1^N: n >=1}. ANSWER LINK

     IV )  Design a Turing machine M to recognize the language  1^N2^N3^N :N>=1

      V)   Construct a TM that accepts the language 0 1* + 1 0*.

     VI)  Design a TM which can multiply two positive integers.

     VII) NONDETERMINISTIC TURING MACHINES .