10211CS106-FLAT(SS24-25)

Let Σ={a,b,c,d}., How many strings are there in Σ4?

• 256

• 16

• 4

• 64

What is the relation between NFA-accepted languages and DFA accepted languages?

• Always greater

• Always lessor

• Equal

• None of the above

Identity the true statement about the properties of DFA

• A DFA Returns only one state always for a input symbol

• The machine can exist in only one state at any given time

• No epsilon transition

• All the above

Production Rule: aAb->agb belongs to which of the following category?

• Regular Language

• Context free Language

• Context Sensitive Language

• Recursively Ennumerable Language

Which of the following statement is correct?

• All Regular grammar are context free but not vice versa

• All context free grammar are regular grammar but not vice versa

• Regular grammar and context free grammar are the same entity

• None of the mentioned

Which of the following is/are the suitable approaches for inferencing?

• Recursive Inference

• Derivations

• Recursive Inference and Derivations

• None of the mentioned

Which of the following allows stacked values to be sub-stacks rather than just finite symbols?

• Push Down Automaton

• Turing Machine

• Nested Stack Automaton

• None of the mentioned

The instantaneous PDA has the following elements

• State

• Unconsumed input

• Stack content

• All of the mentioned

A push down automata is said to be _________ if it has atmost one transition around all configurations.

• Finite

• Non regular

• Non-deterministic

• Deterministic

With reference of a DPDA, which among the following do we perform from the start state with an empty stack?

• process the whole string

• end in final state

• end with an empty stack

• all of the mentioned