3(N)

4(Y)

Choose the Number of states require to accept string ends with 101 2(N)

cann't be determined(N)

1, 2 and 3(N)

2, 3 and 4(N)

Given the language L = {ab, aa, baa}, predict the following strings are in L*. 1)
abaabaaabaa 2) aaaabaaaa 3) baaaaabaaaab 4) baaaaabaa
1, 2 and 4(Y)

1, 3 and 4(N)

Yes(N)

No(Y)

Yes, with input alphabet as a*(N)

Determine that DFA recognize a palindrome number correct or not.

cann\'t be determined(N)

countable infinite(N)
 countable finite(N)

Interpret the languages are over the alphabet R.

uncountable finite(N)

uncountable infinite(Y)

δ: Q × Σ → Q(Y)

δ: Q × Σ → P(Q)(N)

The transition function in a finite automaton is typically represented as:

both a and b (N)

none (N)

Statement 1 is true and Statement 2 is true(Y)

Statement 1 is true and Statement 2 is false(N)

Choose the following options is correct or not. Statement 1: Initial State of NFA
is Initial State of DFA. Statement 2: The final state of DFA will be every
combination of final state of NFA.

Statement 1 can be true and Statement 2 is

true(N)
 Statement 1 is false and Statement 2 is also
false(N)

Union(N)

Concatenation(N)

Choose A regular language over an alphabet ∑ is one that cannot be observed

from the basic languages using which of the operation Kleene*(N)

All of the mentioned(Y)

Statement 1 is false but Statement 2 and 3 are

correct(N)

Statement 1 and 2 are correct while 3 is wrong(N)

Statement 1: A Finite automata can be represented graphically; Statement 2:

The nodes can be its states; Statement 3: The edges or arcs can be used for
transitions Choose the option that make the correct combination.

None of the mentioned statements are correct(N)

All of the mentioned are correct(Y)

 1(N)

2(N)

Choose the number of final states require to accept Φ in minimal finite 3(N)
automata.

None of the mentioned(Y)

Transition graph(N)

Transition Table(N)

Determine A DFA that cannot be represented in the following format. C code(N)

None of the mentioned(Y)

1(N)

3(Y)

The minimum number of states required to recognize an octal number divisible

by 3 can be computed as 5(N)

7(N)

Control Mechanism of an elevator(N)

Determine the one from the following is not an example of finite state machine
system.
 Combinational Locks(N)

Determine the one from the following is not an example of finite state machine
system.

Traffic Lights(N)

Digital Watches(Y)

To specify the start state of the automaton.(N)

To define the alphabet of the automaton.(N)

State the purpose of the transition function in a finite automaton.

To map a state and an input symbol to a set of

states.(Y)

To determine the set of accept states.(N)

Compiler(Y)

Interpreter(N)

If an Infinite language is passed to Machine M, the subsidiary that gives a finite

solution to the infinite input tape is ______________. Determine the correct Loader and Linkers(N)
answer.
If an Infinite language is passed to Machine M, the subsidiary that gives a finite
solution to the infinite input tape is ______________. Determine the correct
answer.

None of the mentioned(N)

Q * Σ* -> Q(Y)

Q * Σ -> Q(N)

Extended transition function is interpreted as.

Q* * Σ* -> Σ(N)

Q * Σ -> Σ(N)

{aa, ab, ba, bb}(N)

{aaaa, abab, ε, abaa, aabb}(Y)

Given: ∑= {a, b} L= {xϵ∑*|x is a string combination} ∑4 .Compute the correct

option.
{aaa, aab, aba, bbb}(N)

All of the mentioned(N)

10011010101(N)

1111001100(Y)

The non- Kleene Star operation develops the following string of finite length
over set A = {0,1} | string s contains even number of 0 and 1.
ε,0011,11001100(N)
The non- Kleene Star operation develops the following string of finite length
over set A = {0,1} | string s contains even number of 0 and 1.

ε,0011,11001100(N)

14 states(Y)

13 states(N)

12 states(N)
The password to the admins account=”administrator”. The total number of
states required to prepare a password-pass system using DFA would be
__________

A password pass system cannot be created using

DFA(N)

{Hello, World, Input, Output, ε}(N)

{Hello, World, ε}(N)

Let ∑= {a, b, …. z} and A = {Hello, World}, B= {Input, Output}, then (A*∩B) U

(B*∩A) can be determined as:

{Input, Output, ε}(N)

{}(Y)

7(Y)

6(N)

The number of elements in the set for the Language L={xϵ(∑r) *|length if x is at
most 2} and ∑={0,1} is examined as _________
The number of elements in the set for the Language L={xϵ(∑r) *|length if x is at
most 2} and ∑={0,1} is examined as _________ 8(N)

5(N)

Statement 1 is correct because Statement 2 is

correct(N)

Statement 2 is correct because Statement 1 is

correct(Y)

Judge among the following that is correct proposition. Statement 1: Non-

determinism is a generalization of Determinism. Statement 2: Every DFA is
automatically an NFA

Statement 2 is false and Statement 1 is false(N)

Statement 1 is false because Statement 2 is

false(N)

NFA is slower to process and its representation

uses more memory than DFA(N)
 DFA is faster to process and its representation uses
less memory than NFA(N)

Determine the following option that is correct.

NFA is slower to process and its representation

uses less memory than DFA(Y)

DFA is slower to process and its representation

uses less memory than NFA(N)

Context free language(N)

Regular language(N)

Examine which of the following the given language belongs to? L={ambmcm|
m>=1}

Both (a) and (b)(N)

None of the above(Y)

2(N)
 3(Y)

If A->aA| a| b, determine the number of steps to form aab:

4(N)

5(N)

1(01)* and (10)*1(N)

x(xx)* and (xx)*x(N)

Judge among the following pair of regular expression that are not equivalent.
(ab)* and a*b*(Y)

x+ and x*x+(N)

(01)*0 = 0(10)*(N)

(0+1)*0(0+1)*1(0+1) = (0+1)*01(0+1)*(N)

Examine the following that is true.

(0+1)*01(0+1)*+1*0* = (0+1)*(N)

All of the mentioned(Y)

Only S1 is correct(N)
 Only S2 is correct(N)

Consider the following two statements: S1: { 02n |n >= l} is a regular language
S2: {0m 0n 0(m+n) | m >= 1 and n >= 2} is a regular language Determine the Both S1 and S2 are correct(Y)
following statements is correct or not.

None of S1 and S2 is correct(N)

Union(N)

Intersection(N)

Regular expressions are illustrated to be closed under Kleen star(N)

All of the mentioned(Y)

3(N)

7(N)

Compute the minimum number of productions required to produce a language

consisting of palindrome strings over input alphabets {a, b} is
5(Y)

6(N)

L1<l2(n)

L1>=L2(N)

Let the class of language accepted by finite state machine be L1 and the class of
languages recognized by regular expressions be L2 then
Let the class of language accepted by finite state machine be L1 and the class of
L1 U L2 = L*(N)
languages recognized by regular expressions be L2 then

L1=L2(Y)

</l2(n)

If it is accepted by automata(Y)

If it halts(N)

Languages of a automata is defined as If automata touch final state in its life time(N)

All language are language of automata(N)

It can’t remember arbitrary large amount of

information(Y)

It sometimes recognizes grammar that are not

regular.(N)

The basic limitation of finite automata is observed as

The basic limitation of finite automata is observed as

It sometimes fails to recognize regular grammar.

(N)

All of the mentioned(N)

1(N)

0(Y)

Finite automata describe the requirement of minimum _______ number of 2(N)

stacks.

None of the mentioned(N)

Same number of transitions(N)

Same number of states(N)

Define the condition are 2 finite machines equivalent.

Same number of states as well as transitions(Y)

 Both are final states(N)

Reachable(N)

Generating(N)

If S->....->xAy->....->w, then A is described as _____________ Both Reachable and Generating(Y)

None of the mentioned(N)

String(N)

Word(N)

The complement of a language will only be defined when and only when the
__________ over the language is defined. Alphabet(Y)

Grammar(N)

Compiler Design(N)

Grammar Parsers(N)

Select the following that is an application of Finite Automaton.

Text Search(N)
Select the following that is an application of Finite Automaton.

All of the mentioned(Y)

Acceptor(N)

Classifier(N)

An automaton that presents output based on previous state or current input is

Transducer(Y)
stated as:

None of the mentioned.(N)

Regular Expression(N)

Rational Expression(N)

Select the kind of expressions do we used for pattern matching?

Regular & Rational Expression(Y)

None of the mentioned(N)

Turing machine(N)

Finite automata(Y)

Select from the following, Regular grammar is accepted by

Select from the following, Regular grammar is accepted by
Linear bound automata(N)

Push down automata(N)

Automata(N)

Tokens(N)

The entity which generate Language is explained as:

Grammar(Y)

Data(N)

Input alphabet(N)

Transition function(N)

Recall which of the following is not a part of 5-tuple finite automata?

Initial state(N)

Output alphabet(Y)

accepted by DFA(Y)

accepted by PDA(N)

A language is defined to be regular if and only if

A language is defined to be regular if and only if accepted by LBA(N)

accepted by Turing machine(N)

Class(Y)

Power Set(N)

Super Set(N)
Regular Expression define precisely the ________ of Regular Language.

None of the mentioned(N)

V(N)

S(N)

Observe which of the expression is appropriate? For production p: a->b where

a∈V and b∈_________ (V+∑)*(Y)

V+ ∑(N)

* , . , +(Y)

. , * , +(N)

Precedence of regular expression in decreasing order is ordered as

. , + , *(N)

+ , a , *(N)
 More than one initial states(N)

Null transitions(N)

Identify that Arden’s theorem is true for

Non-null transitions(Y)

None of these(N)

Recursive Inference(N)

Derivations(N)

Choose which of the following is not a notion of Context free grammars?

(Probable duplicate)
Sentential forms(N)

All of the mentioned(Y)

This flexibility makes Regular expression

invaluable(Y)

Recognize the options which support the given statement? Statement: A regular
expression could be a fixed word or describe something like more general.
 This flexibility makes the Regular expression
unvaluable(N)

Recognize the options which support the given statement? Statement: A regular
expression could be a fixed word or describe something like more general.

This flexibility makes Regular expression invaluable

and unvaluable(N)

None of the mentioned(N)

fan switch outputs {on, off}(N)

electricity meter reading(Y)

Estimate which of the following not an example Bounded Information?

colour of the traffic light at the moment(N)

None of the mentioned(N)

 Every subset of a regular set is regular(N)

Every finite subset of non-regular set is regular(Y)

Select which of the following is true?

The union of two non-regular set is not regular(N)

Infinite union of finite set is regular(N)

0(N)

1(Y)

In a deterministic finite automaton (DFA), how many transitions does each state
have for a given input symbol? multiple(N)

none (N)

2, 4(Y)

1, 3(N)

Given grammar G: (1) S->AS (2) S->AAS (3) A->SA (4) A->aa Select the following
productions which denies the format of Chomsky Normal Form? 1, 2, 3, 4(N)
Given grammar G: (1) S->AS (2) S->AAS (3) A->SA (4) A->aa Select the following
productions which denies the format of Chomsky Normal Form?

2, 3, 4(N)

Palindrome(N)

Reverse(N)

Select which among the following is not notated as infinite language?

Factorial(Y)

L={ab}*(N)

transition function(Y)

translation function(N)

δ explains the best:

equivalence(N)

Kleene operation is performed on the set(N)

Create the NFA using Null moves(Y)

In order to recognize a regular expression, the first step to create the transition
 Null moves are not acceptable, thus should not be
used(N)

In order to recognize a regular expression, the first step to create the transition
diagram is:

Predict the number of states to be used in order to

construct the Regular expression(N)

None of the mentioned(N)

{0, 1, 01, ε}(Y)

{0, 1, ε}(N)

(0+ε) (1+ε) recognizes

{0, 1, 01 ,11, 00, 10, ε}(N)

{0, 1}(N)

[(a+b)*(aa+bb)]*(N)

[(0+1)(0b+a1)*(a+b)]*(Y)

Explain which of the following is not a regular expression?

(01+11+10)*(N)
Explain which of the following is not a regular expression?

(1+2+0)*(1+2)*(N)

Regular Language(N)

Context free Language(N)

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

Context Sensitive Language(Y)

Recursively Enumerable Language(N)

All Regular grammar are context free but not vice

versa(Y)

All context free grammar are regular grammar but

not vice versa(N)

Recognize which of the following statement is correct?

Recognize which of the following statement is correct?

Regular grammar and context free grammar are

the same entity(N)

None of the mentioned(N)

7(N)

10(N)

Determine the no. of strings of length less than 4 contains the language
described by the regular expression (x+y)*y(a+ab)*. 12(Y)

11(N)

i,ii are equal and ii,iii are not(N)

i,ii are equal and i,iii are not(N)

Consider following regular expression i) (a/b)* ii) (a*/b*)* iii) ((ϵ/a)b*)* Which of
the following statements is manipulated as correct

ii,iii are equal and i,ii are not(N)

all are equal(Y)

(1+011) *(Y)
 (1*(011) *)(N)

The following regular expression: ε+1*(011) *(1*(011) *) * is computed as

(1+(011) *) *(N)

(1011) *(N)

S->aS| AB| A| B, D-> b(N)

S->aS| AB| A| B| a, D-> b(Y)

Given grammar G: S->aS| AB A-> epsilon B-> epsilon D-> b Discover the
grammar, removing all the epsilon productions:
S->aS| AB| A| B(N)

None of the mentioned(N)

Statement 1 is true and Statement 2 is true(N)

Statement 1 and Statement 2 both are false(Y)

Choose the correct option: Statement 1: Recursive Inference, using productions

from head to body. Statement 2: Derivations, using productions from body to
head.

Statement 1 is true and Statement 2 is false(N)

 Statement 1 is false and Statement 2 is true(N)

Every CFG for L is ambiguous(Y)

Every CFG for L is unambiguous(N)

Determine the following those statements are correct for a concept called
inherent ambiguity in CFL.

Every CFG is also regular(N)

None of the mentioned(N)

A single state(N)

A set of states(N)

What does the transition function return for a given state and input symbol in a
nondeterministic finite automaton (NFA)?
An output symbol(Y)

The next state(N)

Root with no children is called a leaf(Y)

 A node can have three children(N)

Determine the following statement is false in context of tree terminology.

Root has no parent(N)

Trees are collection of nodes, with a parent child

relationship(N)

From the left(Y)

From the right(N)

Choose the order those are the children of any node ordered. Arbitrarily(N)

None of the mentioned(N)

6(N)

7(Y)

For the expression E*(E) where * and brackets are the operation, discover the
total number of nodes in the respective parse tree are:
5(N)

2(N)
 semantic(N)

syntactic(Y)

If w belongs to L(G), for some CFG, then w has a parse tree, which tell us the
________ structure of w. Determine the correct option. lexical(N)

all of the mentioned(N)

1(Y)

partially true(N)
Choose the correct option: Statement: Unambiguity is the ideal structure of a
language.

Can’t be said(N)

Deterministic Context free grammars(Y)

Non-Deterministic Regular grammars(N)

Choose of the following are always unambiguous.

Context sensitive grammar(N)

None of the mentioned(N)

 -> 0|SS|1SS|SS1|S1S(N)

S-> 1|0S|0SS|SS0|S0S(N)

Discover among the following is the correct grammar for the given language?
L={x∈{0,1}*|number of zeroes in x¹number of one’s in x}

S-> 0|0S|1SS|SS1|S1S(Y)

None of the mentioned(N)

A and ε respectively(Y)

ε and B respectively(N)

AB →AbBc is a type 1 production. Choose here the left and right contexts are

Ab and c respectively(N)

Both are null(N)

Recursive Inference(N)

Derivations(N)

Choose which of the following is not a notion of Context free grammars?

(Probable duplicate)
Sentential forms(N)
(Probable duplicate)

All of the mentioned(Y)

Recursive Inference(N)

Derivations(N)

Judge from the following is/are the suitable approaches for inferencing.
Recursive Inference and Derivations(Y)

None of the mentioned(N)

{0a1b|a=2, b=3}(Y)

{0a1b|a=1, b=5}(N)

{0a1b|a=b}(N)
Discover among the following is the correct option for the given grammar? G-
>X111|G1,X->X0|00

More than one of the mentioned is correct(N)

Statement 1 is true and Statement 2 is true(N)

 Statement 1 and Statement 2, both are false(Y)

Choose the correct option: Statement 1: Recursive Inference, using productions

from head to body. Statement 2: Derivations, using productions from body to
head.

Statement 1 is true and Statement 2 is false(N)

Statement 2 is true and Statement 1 is true(N)

Every CFG for L is ambiguous(Y)

Every CFG for L is unambiguous(N)

Judge the following statements those correct for a concept called inherent
ambiguity in CFL.

Every CFG is also regular(N)

None of the mentioned(N)

2(N)

The minimum number of 1’s to be used in a regular expression of the given 3(Y)
language: R(x): The language of all strings containing exactly 2 zeroes. Choose
the correct answer.
The minimum number of 1’s to be used in a regular expression of the given
language: R(x): The language of all strings containing exactly 2 zeroes. Choose
the correct answer.

0(N)

1(N)

The language of all strings that end with 11 or

00(N)

The language of all strings that end with 0 or 1(N)

The given regular language explains which of the given regular language
∈+1+(1+0)*0+(0+1)*11

The language of all strings which does not end with

01(Y)

None of the mentioned(N)

Absorption Law(N)

Idempotent Law(Y)

Statement: If we take the union of two identical expression, we can replace

them by one copy of the expression. Find following employ’s a correct option for
the given statement.
Closure Law(N)
the given statement.

Commutative Law(N)

correct statement(N)

incorrect statement(N)

Statement: Left most derivations are lengthy as compared to Right most

may or may not be correct(Y)
derivations. Choose the correct option:

depends on the language of the grammar(N)

Left most derivation(Y)

Right most derivation(N)

A->aAa|bAb|a|b|∈ Choose among the following is the correct option for the
given production?
Recursive Inference(N)

None of the mentioned(N)

Ardens theorem(N)

Determine the technique can be used to prove that a language is non-regular?

 Pumping Lemma(Y)

Determine the technique can be used to prove that a language is non-regular?

Ogden’s Lemma(N)

None of the mentioned(N)

The set of strings in {a,b}* with an even number of

b’s(N)

The set of strings in {a, b, c}* where there is no c

anywhere to the left of a(N)

Judge from the following the language that are non-regular.

The set of strings in {0, 1}* that encode, in binary,

an integer w that is a multiple of 3(N)

None of the mentioned(Y)

generating(N)
 reachable(N)

A symbol X is called to be useful if and only if it explains to be: both generating and reachable(Y)

none of the mentioned(N)

G has no useless symbols(N)

G has no unit productions(N)

Choose from the following which is false for a grammar G in Chomsky Normal
Form:

G has no epsilon productions(N)

None of the mentioned(Y)

abstract parse trees(N)

sentence diagrams(N)

Determine the following are distinct to parse trees.

Determine the following are distinct to parse trees.
both abstract parse trees and sentence
diagrams(Y)

none of the mentioned(N)

Push Down Automaton(N)

Turing Machine(N)

Explain which of the following allows stacked values to be sub-stacks rather than
just finite symbols?
Nested Stack Automaton(Y)

None of the mentioned(N)

Push(Y)

Delete(N)

Discover the operations are eligible in PDA?

Insert(N)

Add(N)

Stack is not empty(N)

 Acceptance state(Y)

Identify the situation when a string is accepted by a PDA.

All of the mentioned(N)

None of the mentioned(N)

Present state(N)

Input Symbol(N)

The move of a PDA is discover on the basis of: Present state and Input Symbol(Y)

None of the mentioned(N)

READ or POP(Y)

START or READ(N)

In non-deterministic PDA, there are more than one out going edges from the
following selected states?
POP or REJECT(N)

PUSH or POP(N)
 For non-deterministic PDA, equivalence is
undecidable(N)

For deterministic PDA, equivalence is decidable(N)

Identify among the following that statement is false.

For deterministic PDA, equivalence is

undecidable(Y)

None of the mentioned(N)

No DPDA can accept L by empty stack(Y)

DPDA can accept L by an empty stack(N)

Discover the trueness for the given statement? Statement: If there are strings R
and T in a language L so that R is prefix of T and R is not equivalent to T.

L is regular(N)

None of the mentioned(N)

 Language of all and only Balanced strings(N)

It contains equal number of 0\'s and 1\'s(N)

Let Input Alphabets={0,1}* and the grammar G be: S->epsilon S->SS S->0S1|1S0
Discover which of the following is true for the given statement

Ambiguous Grammar(N)

All of the mentioned(Y)

Type 0(N)

Type 1(N)

Identify the highest type number which can be applied to the following
grammars: S→ As |ab Type 2(Y)

Type 3(N)

rejected(Y)

goes into loop forever(N)

If the PDA does not stop on an accepting state and the stack is not empty, the
string is distinguished as- All of the mentioned(N)
string is distinguished as-

None of the mentioned(N)

If L is a language accepted by PDA1 by final state,

there exist a PDA2 that accepts L by empty stack
i.e. L=L(PDA1)=L(PDA2)(N)

If L is a CFL then there exists a push down

automata P accepting CF; by empty stack i.e.
L=M(P)(N)

Identify the following assertion that is false.

Let L is a language accepted by PDA1 then there

exist a CFG X such that L(X)=M(P)(N)

All of the mentioned(Y)

 Language of all and only Balanced strings(N)

It contains equal number of 0’s and 1’s(N)

Let ∑={0,1}* and the grammar G be: S->ε S->SS S->0S1|1S0 discover which of the
following is true for the given

Ambiguous Grammar(N)

All of the mentioned(Y)

stack(Y)

input tape(N)

The transition a Push down automaton makes is additionally dependent upon terminals(N)
the___. State the correct option.

none of the mentioned(N)

symmetric and reflexive(N)

transitive and reflexive(Y)

|-* is the __________ Explain as a closure of |-

|-* is the __________ Explain as a closure of |-

symmetric and transitive(N)

none of the mentioned(N)

process the whole string(N)

end in final state(N)

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

end with an empty stack(N)

all of the mentioned(Y)

No state p has two outgoing transitions(Y)

More than one state can have two or more

outgoing transitions(N)

A DPDA is Explain as a PDA in which:

Atleast one state has more than one transitions(N)

 None of the mentioned(N)

nested word automata(Y)

push down automata(N)

Finite-state acceptors for the nested words can be defined as:

ndfa(N)

none of the mentioned(N)

Complement(Y)

Union(N)

A language accepted by Deterministic Push down automata is estimated to be All of the mentioned(N)
closed under which of the following?

none of the mentioned(N)

Pushing(N)

Popping(N)

Select the following the actions that operates on stack top.

Select the following the actions that operates on stack top.
Replacing(N)

All of the mentioned(Y)

Finite(N)

Non Reqular(N)

A push down automata is explained to be _________ if it has atmost one

transition around all configurations.
Non Deterministic(N)

Deterministic(Y)

Greibach Normal form(N)

Context Sensitive Language(Y)

a→b Restriction: Length of b must be atleast as much length of a. Select the

following that is correct for the given assertion. Chomsky Normal form(N)

Recursively Ennumerable language(N)

Left Recursive Grammar(N)

 Right Recursive Grammar(Y)

There exists a Context free grammar such that: X->aX Predict which among the
following is correct with respect to the given assertion?

Non Recursive Grammar(N)

None of the mentioned(N)

Chomsky Hierarchy(N)

Sentinal Form(Y)

If the partial derivation tree associates the root as the starting variable, the form
is known as: Root Form(N)

None of the mentioned(N)

a(a*Ub*)b(Y)

a*(aUb)b*(N)

Select a regular expression for a grammar which generates a language which

states: L contains a set of strings starting wth an a and ending with a b, with
something in the middle.
a(a*b*)b(N)
something in the middle.

None of the mentioned(N)

Every vertex has a label which is a terminal or a

variable.(N)

The root has a label which can be a terminal.(Y)

Select among the following is incorrect with reference to a derivation tree?

The label of the internal vertex is a variable.(N)

None of the mentioned(N)

aabbaab(N)

aabbaa(Y)

Let G=(V, T, P, S) where a production can be written as: S->aAS|a, A->SbA|ba|SS baabab(N)
Illustrate among which of the following string is produced by the grammar?
Let G=(V, T, P, S) where a production can be written as: S->aAS|a, A->SbA|ba|SS
Illustrate among which of the following string is produced by the grammar?

None of the mentioned(N)

Statement 1 is true but statement 2 is false(N)

Statement 1 is false but statement 2 is true(N)

Statement 1: Ambiguity is the property of grammar but not the language.

Statement 2: Same language can have more than one grammar. Select which of
the following options are correct with respect to the given statements?

Both the statements are true(Y)

Both the statements are false(N)

Removal of useless symbols(N)

Removal of unit productions(N)

Select among the following are non-essential while simplifying a grammar.

Removal of null production(N)

None of the mentioned(Y)

 Recursive(N)

Deterministic CFL(N)

The language L ={a^i2b^i|i>=0} is stated as:

Regular(N)

Both A and B(Y)

All palindromes(N)

All even palindromes(N)

All odd palindromes(Y)

L->rLt|tLr|t|r The given grammar produces a language which is summarized as:

Strings with same begin and end symbols(N)

an element of G(N)

initial stack symbol(N)

A pushdown automaton can be explained as: (Q, ∑, G, q0, z0, A, d). What does
the symbol z0 represents?
top stack alphabet(N)
A pushdown automaton can be explained as: (Q, ∑, G, q0, z0, A, d). What does
the symbol z0 represents?

all of the mentioned(Y)

real machine(N)

abstract machine(N)

A turing machine defines a

hypothetical machine(N)

more than one option is correct(Y)

finite memory tape(N)

infinite memory tape(Y)

A turing machine operates over ________. Select the correct choice

depends on the algorithm(N)

none of the mentioned(N)

writes the symbol(N)

 moves the tape one cell left/right(N)

State which of the functions are not performed by the turing machine after
reading a symbol?

proceeds with next instruction or halts(N)

none of the mentioned(Y)

Does a machine exists that can determine whether

any arbitrary machine on its tape is circular.(N)

Does a machine exists that can determine whether

Select the problems that were not answered when the turing machine was any arbitrary machine on its tape is ever prints a
invented? symbol(N)

Hilbert Entscheidungs problem(N)

 None of the mentioned(Y)

Turing Completeness(Y)

Simulation(N)

The ability for a system of instructions to simulate a Turing Machine is defined

as _________ Turing Halting(N)

None of the mentioned(N)

Transition graph(N)

Transition table(N)

Turing machine can be recognized using the following tools:

Queue and Input tape(N)

All of the mentioned(Y)

Turing machine(N)

theoretical model of computer(N)

Select which of the following is false for an abstract machine?

Select which of the following is false for an abstract machine?

assumes a discrete time paradigm(N)

all of the mentioned(Y)

thought experiments(N)

principle(N)
Fill in the blank with the most appropriate option. Statement: In theory of
computation, abstract machines are often used in ___________ regarding
computability or to analyze the complexity of an algorithm.

hypothesis(N)

all of the mentioned(Y)

Nested Turing machines(N)

Universal Turing machine(Y)

A turing machine that is able to simulate other turing machines is defined as:

Counter machine(N)

None of the mentioned(N)

 2(N)

5(N)

While applying Pumping lemma over a language, we observe a string w that

belong to L and fragment it into _________ parts.
3(Y)

6(N)

Generating(N)

Pumping(Y)

Let w= xyz and y refers to the middle portion and |y|>0. Define what do we call
the process of repeating y 0 or more times before checking that they still belong
to the language L or not?
Producing(N)

None of the mentioned(N)

n(Y)

|y}(N)

There exists a language L. We define a string w such that w∈L and w=xyz and |
w| >=n for some constant integer n. What can be the maximum length of the
substring xy i.e. |xy|<=? |x|(N)

None of the mentioned(N)

 p*1(N)

p+1(Y)

Fill in the blank in terms of p, where p defines the maximum string length in L.
Statement: Finite languages trivially satisfy the pumping lemma by having n = p-1(N)
______

None of the mentioned(N)

Halting problem(N)

Boolean Satisfiability problem(N)

Select the problems those are unsolvable.

Halting problem & Boolean Satisfiability

problem(Y)

None of the mentioned(N)

input tape(N)

head(N)

Select which of the following a turing machine does not consist of?
Select which of the following a turing machine does not consist of? state register(N)

None of the mentioned(Y)

6(N)

7(Y)

The value of n if turing machine is defined using n-tuples:

8(N)

5(N)

It is recursively ennumerable(N)

It is undecidable(N)

State, the following is true for The Halting problem.

Both (a) and (b)(Y)

None of the mentioned(N)

writes the symbol(N)

Identify the functions are not performed by the turing machine after reading a
symbol?
 moves the tape one cell left/right(N)

Identify the functions are not performed by the turing machine after reading a
symbol?

proceeds with next instruction or halts(N)

None of the mentioned(Y)

an element of G(N)

initial stack symbol(Y)

In pushdown automata notation, write the symbol z0 recognizes?

top stack alphabet(N)

all of the mentioned(N)

Multi tape turing machine(N)

Multi track turing machine(N)

Select which of the following are the models equivalent to Turing machine?
Select which of the following are the models equivalent to Turing machine?

Register machine(N)

All of the mentioned(Y)

2p(N)

Let L be a CFL. Then there is an integer n so that for any u that belong to
language L satisfying |t|>=n, there are strings u, v, w, x, y and z satisfying
t=uvwxy. Let p be the number of variables in CNF form of the context free
grammar. The value of n in terms of p is defined as

2^p(N)

2p+1(Y)

p^2(N)

{aibici|i>=0}(N)

{0i1i|i>=0}(Y)

State among the following gives a positive result to the pumping lemma
{ss|s∈{a,b}*}(N)
restrictions and requirements?

None of the mentioned(N)

 {aibici|i>=0}(N)

{ss|s∈{a,b}*}(N)

Using pumping lemma, state the following cannot be proved as ‘not a CFL’. The set legal C programs(N)

None of the mentioned(Y)

Turing Class(N)

Recursive Languages(N)

The class of recursively enumerable language is defined as:

Universal Languages(N)

RE(Y)

x+1(N)

x(N)

Define the pumping length of string of length x?

x-1(N)

x^2(Y)

Finite languages(N)
 Context free languages(N)

State which of the following does not obey pumping lemma for context free
languages?
Unrestricted languages(Y)

None of the mentioned(N)

one read only input(N)

two storage tapes(N)

State which of the following is true for two stack turing machines?
one read only input & two storage tapes(Y)

None of the mentioned(N)

ambiguous turing machine(N)

unambiguous turing machine(Y)

A deterministic turing machine is defined as:

A deterministic turing machine is defined as:

non-deterministic(N)

none of the mentioned(N)

a stands for automatic(N)

left ended, right end-infinite(N)

Define which of the following is true about Turing’s a-machine?

finite number of tape symbols were allowed(N)

all of the mentioned(Y)

1 1(Y)

Deterministic Finite Automata (DFA)(Y)

Turing Machines(N)

Select the type of automata used for recognizing regular languages.

Pushdown Automata(N)
Select the type of automata used for recognizing regular languages.

Non-deterministic Turing Machines(N)

Context-free grammars(N)

Regular expressions(Y)

In terms of grammars, select what regular languages correspond to:

Chomsky grammars(N)

Unrestricted grammars(N)

DFA can recognize languages that Regular

Expressions cannot(N)

Regular Expressions can recognize languages that

DFA cannot(N)

Select the equivalence relationship between a Deterministic Finite Automaton

(DFA) and a Regular Expression.
Select the equivalence relationship between a Deterministic Finite Automaton
(DFA) and a Regular Expression.

They are equivalent, recognizing the same class of

languages(Y)

They have no relation to each other(N)

Deterministic Finite Automaton (DFA)(N)

Non-deterministic Finite Automaton (NFA)(Y)

Select the type of automaton allowing multiple possible transitions for a given
input symbol from a state.

Turing Machine(N)

Pushdown Automaton(N)

They can be divided into finite sets(N)

They can be split into multiple subsets(N)

Under the pumping lemma, select the property that regular languages satisfy:
Under the pumping lemma, select the property that regular languages satisfy:

They can be pumped or repeated to generate new

strings in the language(Y)

They cannot be recognized by any automaton(N)

To reduce the number of states while recognizing

the same language(Y)

To increase computational complexity(N)

Identify the main purpose of minimizing a finite automaton:

To make the automaton non-deterministic(N)

To recognize more languages(N)

 The language recognized remains the same(Y)

The language recognized changes(N)

Select the result for converting a non-deterministic finite automaton (NFA) to a

deterministic finite automaton (DFA):

The automaton becomes infinite(N)

The automaton becomes non-deterministic(N)

Finite sets of strings(Y)

Infinite sets of strings(N)

Select what regular expressions describe:

Only numbers(N)

Complex data structures(N)

 accepted by DFA(Y)

accepted by PDA(N)

Select the condition defining a language as regular if and only if_______ accepted by LBA(N)

accepted by Turing machine(N)

Every CFG for L is ambiguous(Y)

Every CFG for L is unambiguous(N)

Choose the following statements are correct for a concept called inherent
ambiguity in CFL?

Every CFG is also regular(N)

None of these(N)

Acceptance state(Y)

All of the mentioned(N)

select the situation when a string is accepted by a PDA.

None of the mentioned(N)
 Present state(N)

More than one state can have two or more

outgoing transitions(N)

Atleast one state has more than one transitions(N)

Select DPDA is defined as a PDA in which:

None of the mentioned(N)

nested word automata(Y)

It signifies the end of the DFA(N)

It represents the initial configuration of the DFA(Y)

Select the purpose of the start state in a DFA:

It indicates the acceptance state(N)

 It is optional and may not be present(N)

DFA has multiple start states(N)

DFA has a single start state(Y)

Select the distinguishing feature of a DFA compared to a Non-deterministic

Finite Automaton (NFA):
DFA has an infinite number of states(N)

DFA has non-unique transitions(N)

It signifies the end of the DFA(N)

It represents the initial configuration of the DFA(N)

Select the purpose of an accepting state in a DFA:

Select the purpose of an accepting state in a DFA:

It indicates that the DFA has accepted the input

string(Y)

It is optional and may not be present(N)

Yes(N)

No(Y)

Only if it has more than one accepting state(N)

Can a DFA recognize non-regular languages?

Only if it has a large number of states(N)

It is not necessary in a DFA(N)

It maps a state and an input symbol to a set of

states(N)

Recall which of the following is true about a DFA\'s transition function?

Recall which of the following is true about a DFA\'s transition function?

It maps a state and an input symbol to a unique

next state(Y)

It maps an input symbol to a state(N)

Unlimited(N)

Exactly 2(N)

State the maximum number of states that can be present in a state transition
diagram of a DFA:
Finite(Y)

At least 3(N)

Deterministic Finite Alphabet(N)

Deterministic Finite Automata(Y)

Tell what does DFA stand for in the context of computer science?

Digital Finite Algorithm(N)

Deterministic Finite Analysis(N)

1(N)
 2(Y)

Select the minimum number of states required to recognize the language

represented by the regular expression (01)*: 3(N)

4(N)

1(N)

2(Y)

Select the minimum number of states required to recognize the language

represented by the regular expression (ab)*: 3(N)

4(N)

Nondeterministic Final Automaton(N)

Non-Finite Automaton(N)

Identify the full form of NFA :

Nondeterministic Finite Automaton(Y)

New Finite Algorithm(N)

Infinite(Y)

Recall how many states can an NFA have?

 Finite(N)

Recall how many states can an NFA have? Variable(N)

Bounded(N)

One(N)

Two(N)

Select for an NFA, how many transitions can occur for a given input symbol and
current state? Multiple(Y)

None(N)

It can have only one possible transition for a given

input symbol and current state.(N)

It always moves to a unique state for a given input

symbol and current state.(N)
Select which of the following describes an NFA?

It can have epsilon transitions.(Y)

 It has a fixed number of states.(N)

Any state in the set of states(N)

The first state in the set of states(N)

Locate in an NFA, what is the initial state?

A designated start state(Y)

The final state(N)

It maps a state and an input symbol to a set of

states.(Y)

It maps a state and an input symbol to a single

state.(N)

Identify from the following options that is true about an NFA\'s transition
function:

It maps a set of states and an input symbol to a

single state.(N)
 It maps a state to a set of input symbols.(N)

Yes, always(Y)

No, never(N)

It depends on the NFA(N)

Select whether an NFA can accept strings of infinite length:

Only if it has an infinite number of states(N)

They are where the NFA starts processing input

strings.(N)

They determine whether a string is accepted or

rejected.(Y)

Identify the role of the final states in an NFA:

They are the states where the NFA gets stuck.(N)

 They are not relevant in NFA operations.(N)

A transition without consuming any input

symbol(Y)

A transition to the next state in lexicographic

order(N)

Identify for an NFA, what does an epsilon transition represent:

A transition to the final state(N)

A transition triggered by an non-empty input

string(N)

Yes(N)

No(Y)

Only if it has a single initial state(N)

Memorize whether an NFA have no final states?
Memorize whether an NFA have no final states?

Only if it has no transitions(N)

To generate strings in a regular language(N)

To prove that a given language is regular(N)

Select the primary purpose of the Pumping Lemma:

To determine the length of strings in a regular

language(N)

To disprove that a given language is regular(Y)

Assume the language is regular.(Y)

Choose a string from the language.(N)

Select the correct option for :Which of the following is NOT a step in applying
the Pumping Lemma to prove a language is not regular?
Select the correct option for :Which of the following is NOT a step in applying
the Pumping Lemma to prove a language is not regular?
Pump the string to generate a longer string.(N)

Show that the pumped string is not in the

language.(N)

Generating new strings from existing ones in the

language(N)

Breaking down strings into smaller substrings(Y)

Select the correct option for :In the context of the Pumping Lemma, what
does \"pumping\" refer to?

Adding additional characters to strings(N)

Recognizing strings using a finite automaton(N)

 The length of the pumped string must be less than
or equal to the pumping length.(N)

The pumped string must remain in the language

after pumping.(N)

Identify which of the following is NOT a condition of the Pumping Lemma?

The language must be regular.(N)

The length of the pumped string must be greater

than the pumping length.(Y)

Regular languages only(N)

Context-free languages only(N)

Select the type of languages to which the Pumping Lemma is applicable:

Select the type of languages to which the Pumping Lemma is applicable: Both regular and context-free languages(Y)

Neither regular nor context-free languages(N)

The non-constant of the pumped string(N)

The minimum length of a regular language(N)

Select the significance of the "pumping length" (p) in the Pumping Lemma:

A constant for a given regular language(Y)

The maximum length of a regular language(N)

Pumping property(N)

Identify the property that is crucial for the Pumping Lemma to hold for a regular
 Concatenation property(N)

Identify the property that is crucial for the Pumping Lemma to hold for a regular
language:
Closure property(Y)

Closure under union property(N)

Every language can be recognized by a finite

automaton(N)

Every regular language has a pumping length(Y)

Recall ,what Pumping Lemma state about regular languages?

Every regular language has an infinite number of

strings(N)

Every regular language contains a palindrome(N)

 The language must be context-free(Y)

The language must contain an infinite number of

strings(N)

Select the requirement for applying the Pumping Lemma to a language:

The language must be finite(N)

The language must be regular(Y)

Non-determinism(N)

Infiniteness(N)

Select the key property of regular languages that the Pumping Lemma
leverages?
Determinism(N)

Repetition(Y)

Intersection(Y)

Union(N)

Select the operation that preserves the regularity of languages:

Select the operation that preserves the regularity of languages:
Substitution(N)

Kleene star(N)

The complement of a regular language is always

regular.(Y)

The complement of a regular language is never

regular.(N)

Select from the following statements that is true about the complement of a
regular language:

The complement of a regular language is context-

free.(N)

The complement of a regular language is context-

sensitive.(N)

It refers to the ability of regular languages to be

closed under certain operations.(Y)
 It indicates the ability of regular languages to
concatenate strings indefinitely.(N)

Select the meaning of closure property in the context of regular languages:

It signifies the closure of regular languages to

external modifications.(N)

It represents the closure of regular languages to

additional symbols.(N)

The intersection of regular languages is always

regular.(Y)

The intersection of regular languages is always

context-free.(N)

Identify which of the following statements is true about the intersection of

regular languages?
Identify which of the following statements is true about the intersection of
regular languages?

The intersection of regular languages is always

context-sensitive.(N)

The intersection of regular languages is never

regular.(N)

It represents the concatenation of two regular

languages.(N)

It indicates the closure of a regular language under

concatenation.(N)

Select the purpose of Kleene star operation that is applied to a regular language:

It denotes the union of a regular language with its

complement.(N)
 It signifies the closure of a regular language under
iteration.(Y)

The complement of a regular language is always

context-free.(N)

The complement of a regular language is never

regular.(N)

Select the property of regular languages that is true regarding their

complement:

The complement of a regular language is always

regular.(Y)

The complement of a regular language is always

context-sensitive.(N)

Regular languages are closed under union.(Y)

 Regular languages are not closed under union.(N)

Select the closure property of regular languages that is true regarding union:

Regular languages have no union operation.(N)

Regular languages are closed under concatenation.

(N)

Regular languages are closed under intersection.

(Y)

Regular languages are not closed under

intersection.(N)

Select the option which is true about the closure of regular languages under
intersection:

Regular languages are only partially closed under

intersection.(N)
 Regular languages are closed under union, not
intersection.(N)

Intersection(N)

Concatenation(N)

select the operation that is closed under regular languages:

Complementation(N)

All of the above(Y)

Closure under complementation(N)

Closure under concatenation(Y)

Identify the property that allows regular languages to be recognized by finite

automata:

Closure under union(N)

Closure under intersection(N)

It allows for non-deterministic computation.(N)

 It limits the machine's ability to solve certain
problems.(N)

In a Turing machine, Select the significance of the transition function being

partial?

It defines transitions only for specific states and

symbols.(Y)

It ensures the machine always halts.(N)

Tape(N)

Head(N)

Recognize the component of a Turing machine that is responsible for Transition function(Y)
determining the next action based on the current state and symbol read?

State register(N)

To define the set of symbols allowed on the tape.

(Y)
 To specify the initial state of the machine.(N)

Select the purpose of the input alphabet in a Turing machine?

To control the movement of the tape.(N)

To determine the next state based on the current

state and symbol read.(N)

It indicates an error in computation.(N)

It marks the end of the computation.(Y)

Select the significance of the halting state in a Turing machine?

It signifies a transition to a new state.(N)

It represents an undefined state.(N)

 Infinite memory tape(N)

Finite set of states(N)

Recognize from the following is NOT a characteristic of a Turing machine?

Finite alphabet of symbols(N)

Finite computation time(Y)

It applies to all languages.(N)

It guarantees that any string in the language can

be divided into five parts.(N)

Select the following statements is true regarding the Pumping Lemma for
Regular Languages.

It can prove that a language is regular, but not

necessarily that a language is not regular.(Y)
 It applies only to context-free languages.(N)

It states that every sufficiently long string in the

language can be split into parts such that certain
properties hold.(Y)

It guarantees that every string in the language can

be pumped to generate an infinite number of
strings.(N)

Select from following is a correct interpretation of the Pumping Lemma for

Regular Languages.

It asserts that every language can be generated by

a regular expression.(N)
 It ensures that every regular language can be
recognized by a deterministic finite automaton
(DFA).(N)

It applies only to regular languages.(N)

It can prove that a language is context-free, but

not necessarily that a language is not context-free.
(Y)

Select from the following statements is true regarding the Pumping Lemma for
Context-Free Languages.

It applies only to languages generated by regular

expressions.(N)

It guarantees that every context-free language is

decidable.(N)
 The existence of an infinite number of strings in
the language.(N)

The existence of a regular expression generating

the language.(N)

Select from the following, the Pumping Lemma for Context-Free Languages can
be used to prove that-

The existence of a context-free grammar

generating the language.(Y)

The existence of a context-sensitive grammar

generating the language.(N)

To describe the structure of context-sensitive

languages(N)
 To describe the structure of regular languages(N)

Choose the main purpose of a context-free grammar?

To describe the structure of context-free

languages(Y)

To describe the structure of recursively

enumerable languages(N)

Terminals(N)

Variables(N)

Choose the following that is not a component of a context-free grammar.

Lexemes(Y)

Productions(N)

Terminal symbols(N)

Choose in a context-free grammar, a production rule typically consists of:

 Terminal symbols(N)

Choose in a context-free grammar, a production rule typically consists of:

Both terminal and non-terminal symbols(Y)

Regular expressions(N)

They can recognize all regular languages.(N)

They can generate all regular languages.(Y)

Choose the following is true about context-free grammars.

They can generate some regular languages but not

all.(N)

They cannot generate any regular languages.(N)

 They represent the basic building blocks of the
language.(N)

They represent specific strings of characters.(N)

Choose the role of non-terminal symbols in a context-free grammar.

They represent variables that can be replaced by

other symbols.(Y)

They represent the final output of the grammar.

(N)

To recognize regular languages(N)

To recognize context-free languages(N)

Select the primary purpose of a pushdown automaton (PDA)?

Select the primary purpose of a pushdown automaton (PDA)?
To recognize context-sensitive languages(Y)

To recognize recursively enumerable languages(N)

Finite automaton(N)

Deterministic finite automaton(N)

Select the following automata is equivalent to a pushdown automaton?

Turing machine(Y)

Non-deterministic finite automaton(N)

All regular languages(N)

All context-free languages(Y)

Select the following languages can be recognized by a pushdown automaton?

Select the following languages can be recognized by a pushdown automaton?
All context-sensitive languages(N)

All recursively enumerable languages(N)

It determines the acceptance of the input string.

(N)

It represents the bottom of the stack.(N)

Select the significance of the initial stack symbol in a pushdown automaton?

It determines the start state of the automaton.(N)

It represents the top of the stack.(Y)

Input tape(N)

Stack(Y)

Select component that makes a pushdown automaton more powerful than a

finite automaton.
Select component that makes a pushdown automaton more powerful than a
finite automaton. Transition function(N)

State register(N)

They cannot recognize non-context-free

languages.(N)

They require more memory compared to finite

automata.(N)

Select the following is not a limitation of pushdown automata?

They cannot recognize non-regular languages.(N)

They cannot recognize non-context-sensitive

languages.(Y)
Define alphabet, string, and language with examples.

Explain Chomsky's hierarchy with an example for each type of language.

2p
2p

Determine how many states are required to build an equivalent Finite Automata
for the given regular expression (0+1)*(00+11)(0+1)*

Interpret the reason why the length of output is more than input in a Moore
Machine?

Illustrate the way of designing a DFA.

Illustrate an example to explain the process used to convert a non-deterministic

finite automaton to deterministic finite automata.

Establish a DFA to accept strings of a’s and b’s starting with the string ab

Construct the transition diagram of a FA which accepts all strings of 1's and 0's in
which both the number of 0's and 1's are even.

Briefly describe the different types of grammar on the basis of Productions.

Explain the difference between two types of FA with an example.

List out the identities of Regular expression.

State and Prove Arden’s Theorem

Explain the applications of Context Free Grammar?

Explain Leftmost and Rightmost derivation tree with an example.

Illustrate the FA from given regular expression 10 + (0 + 11)0* 1.

Consider the following CFG: E --> E+E |E*E |a. Predict
whether the CFG with this production rule is ambiguous or
not.

Examine the language L = {a2n | n>= 1} is regular.

Define Moore's Machine with an example.

Explain the working and formal defination of Push Down Automata utilizing a
stack.

Express the DFA to accept strings of a’s and b’s having a sub string aa with a
diagram.

Apply the rules to Convert the grammar into CNF by an example

Explain the key differences between Mealy and Moore machines. In what
scenarios would you prefer to use each type of finite state machine? Compare
and contrast their advantages and disadvantages.

Illustrate the CNF form for the following Grammar:

S-->bA| aB A-->bAA|aS|a B-->aBB|bS|a

Given L is the set of all even palindromes over {a, b}. Construct the PDA

Determine the Instantaneous description (ID) in PDA with an example.

Explain the equivalence of CFL and PDA.

Discuss the ambiguity in CFG with an example.
Explain the Closure properties of Context Free Languages with example.
Describe Chomsky Normal Form (CNF) and Greibach Normal Form (GNF)

Rewrite after the removal of the unit production from the grammar S-->AB, A--
>E,B-->C,C-->D,D-->b, E-->a
Rewrite after the removal of the unit production from the grammar S-->AB, A--
>E,B-->C,C-->D,D-->b, E-->a

Analyze after the removal of ϵ productions from the grammar S-->ABaC, A-->BC,
B-->b/ ϵ, C→D/ ϵ, D-->d
Analyze after the removal of ϵ productions from the grammar S-->ABaC, A-->BC,
B-->b/ ϵ, C→D/ ϵ, D-->d

Explain the process for converting PDA into an equivalent CFG.

Explain the process for converting PDA into an equivalent CFG.

Explain linear grammar with example.

Define computations of a TM.

Describe linear bounded automaton.

Enumerate in detail about the different variations of the Turing Machine?

State Church Turing Thesis and how is it important in context of Turing

Machines.

Describe the Halting Problem of Turing Machine

Define Post-Correspondence Problem in Turing Machine

Give an example to examine the concept of Undecidable Problem?

State RICE Theorem and how is it important.

Enumerate the ways to convert a multi-tape to a single tape Turing machine

Estimate the below finite automata to check whether the following strings are
accepted or not. δ(q0,0) =q1, δ(q0,1) =q3, δ(q1,0)=q0, δ(q1,1)=q2, δ(q2,0)=q3,
δ(q2,1)=q1, δ(q3,0)=q2, δ(q3,1)=q0. q0 is initial and q2 is final state. (i) 1110 (ii)
0001 (iii) 1010

Estimate whether the language L= {w|w is a palindrome on {a,b}*} is regular or

not.

Evaluate the parse tree for generating the string 11001010 from the given
grammar: S→1B|0A A→1|1S|0AA B→0|0S|1BB

A PDA is more powerful than a finite automaton. Criticize this statement.

Estimate a PDA which recognizes all strings that contain equal number of 0’s and
1’s.
Illustrate the equivalent CFG for the Expression: (a+b)*aa(a+b)*

Explain PDA for the CFG generated for the set of all strings over the alphabet {a,
b} with exactly twice as many a’s and b’s.

Formulate a multi head Turing Machine for checking whether a binary string is a
palindrome or not.
Justify how turing machine can work as Enumerator

Express the use of recursive and recursive enumerable languages.

Explain NFA with epsilon with an example

Explain with an example of an ambiguous CFG.

Explain the following grammar-

S → aB / bA

S → aS / bAA / a

B → bS / aBB / b

(Unambiguous Grammar)

Let us consider a string w = aaabbabbba

Now, let us derive the string w using rightmost derivation.

Examine the given grammar G is ambiguous or not.

S → aSb | SS
S→ε
Explain the context-sensitive languages, and how do they differ from context-
free languages?
Generalize are context-sensitive grammars defined, and what distinguishes
them from context-free grammars?
Can you explain the concept of linear bounded automata (LBA) and their
connection to context-sensitive languages?
Describe some examples of languages that are context-sensitive but not
context-free, and explain the process using context-sensitive grammars.
Classify the computational power of linear bounded automata compare to other
types of automata, such as Turing machines?
Discover the relationship between context-sensitive grammars and linear
bounded automata in terms of language recognition?

Analyze the grammar G with production

rules −

X → X X | X*X |X| a

is ambiguous or not.
Analyze the Grammar given below −

E⇒ E+E|E ∗∗ E|id

Find:

Leftmost

Rightmost Derivation for the string.

a(Probable duplicate)

S
S

Describe the concept of ε-closure in the context of converting a DFA to an NFA.

Provide an example.

Li(Probable duplicate)

De

Li(Probable duplicate)

Di

Ex(Probable duplicate)
Ex(Probable duplicate)

Describe DFA with an example.

Describe NFA with an example.

Correlate the Pumping Lemma for Regular Languages and explain its significance
in the context of proving that a language is not regular.

Briefly explain three properties of regular languages

Illustrate the role of ε-closures in the conversion process from an NFA to a DFA.
Provide examples to illustrate your explanation.

A(Probable duplicate)

W
E

Explain the concept of regular expressions and their significance in formal

language theory. Discuss how regular expressions are used to define regular
languages, and provide examples illustrating the relationship between regular
expressions and regular languages.

Explain the role of regular expressions in formal language theory. How are
regular expressions used to define languages, and what are the key operations
associated with regular expressions? Provide examples to illustrate your points.

Explain the properties of regular languages and their connection to regular

expressions. How do regular expressions capture the essential features of
regular languages? Provide examples to illustrate your points.

Explain Reduced Form of a CFG and how to obtain them?

Illustrate the given NFA into its equivalent DFA.

Estimate a FA from given regular expression 10 + (0 + 11)0* 1.

Estimate the FA for regular expression 0*1 + 10.

Define Instantaneous Description in Turing Machine.

Define Halt state in Turing Machine:

Describe the concept of a Turing Machine's tape head movement and its
significance in computation.
Discuss the concept of non-deterministic Turing Machines (NTMs) and explain
how they differ from deterministic Turing Machines (DTMs).
Explain the significance of the halting problem in the theory of computation, and
discuss its implications for Turing Machines.
Define the concept of Turing Machine decidability and provide an example of a
decidable language.
Discuss the Church-Turing thesis and its significance in the theory of
computation.

Convert the given CFG to CNF. Consider the given grammar G1:
S → a | aA | B
A → aBB | ε

B → Aa | b
Predict how left and right recursion can be obtained from a parse tree with
example

Draw a PDA for the CFG given below:

S → aSb

S→a|b|ε
Convert the regular expression *(a|b)abb into an NFA.
Prove that the union of two regular languages is always regular.
Analyze and classify Chomsky’s Hierarchy of formal languages.

Determine distinguishable, undistinguishable states, dead and unreachable state

for any given DFA.

With example explain the extended transition function for a DFA

Define epsilon closure of a state with example and describe its significance in
Automata.

Distinguish between three types of Finite State Machines.

Discuss different properties of Regular Sets with proper examples.

Ex(Probable duplicate)
Construct finite automaton to accept the language generated by the following
grammar: S →aA| ϵ A →aA| bB|ϵ B →bB| ϵ
Let G be the grammar S →Ab|ba A →a|aS|aAA B →b|bS|aBB For the string
aaabbabbba establish the leftmost and rightmost derivation tree.
Convert the given Grammar to GNF: S→CA|BB, B→b|SB, C→b, A→a

Explain the formal description of Linear Bounded Automata. Also state the
closure properties of the language supported by it.
Estimate the PDA that recognize the set of all strings over 0,1 that contains at
least one 1

Discuss a PDA to accept L={wwR | w∈ {a,b}* and wR is the reverse of the string
w} by an empty stack and final state.
Discuss a PDA to accept L={wwR | w∈ {a,b}* and wR is the reverse of the string
w} by an empty stack and final state.

Remove Unit and Null productions for the grammar: S-> ASA|aB, A ->B|S, B->b|
^ (Here ^ is the null production)
Define the moves made by the Turing Machine with an example

Recognize operations that are possible on the tape of a turing machine.

Compare between the different representations of Finite Automata to recognize

a string.

Conclude whether the NFA and subsequent DFA derivation of the following
regular expression is possible: (0|1) *0

Assess the utility of different parts of a machine while processing any input.
Estimate a grammar to generate the following language: L = {0^m1^m2^n | m>=
1 and n>=0}.

Argue the design of a CFG and the type of machine used for the following
language: L= {a^nb^nc^n: n>=0}

Deduce the given CFG after its reduction: S→AC |B, A→a, C→c|BC, E→aA|∈.
Deduce the given CFG after its reduction: S→AC |B, A→a, C→c|BC, E→aA|∈.

Estimate the CFG after elimination of left recursion from the following Grammar.
E→E+T|T, T→T*F|F, F→(E)|id
E→E+T|T, T→T*F|F, F→(E)|id

Show a by a diagram the regular language for each of the following language:
L={w Ɛ {a,b}*:w does not end in aa}
Analyze the steps necessary to minimize the CFG.
Deduce the string 0100110 for the given Grammar by using the Leftmost and
Rightmost derivation. S→ 0S|1AA, A→0|1A|0B, B→1|0BB
Estimate the CFG after removal of Left recursion from the grammar. S→Sab|T,
T→Tcd|F, F→Fa|G

Explain the moves made by PDA to accept by final state the language of all
strings of 0’s and 1’s such that number of 1’s is less than number of 0’s.
Show that L - {ww| w ∈ {0,1}* } is not context free
Estimate the CNF form for the given CFG: S→1A|0B, A→1AA|0S|0, B→0BB|1S|
1

Criticize the Decision problems for CFLs with example?

Estimate a PDA that accepts the language L over {0, 1} by empty stack which
accepts all the string of 0s and 1s in which a number of 0s are twice of number
of 1s.
Develop a Turing Machine for the language L = {0^n1^n2^n} where n≥1
Design a Turing machine for a language that recognizes equal no. of 0s and 1s.
Create a Turing machine that accepts the language over (a,b), for all strings that
contains “aba” as a substring.

Justify whether the language L={0n1n|n>=1} is regular or not with the use of
Pumping lemma.
Create a Turing machine which accepts even pallindrome
Construct a turing machine for a language over (0,1) that starts with 011
Compare and contrast the advantages and disadvantages of Mealy and Moore
machines in various applications.

Estimate the Regular Expression for the following DFA δ(P,1)= P, δ(P,0)= S,
δ(S,1)= R, δ(S,0)= Q, δ(R,0)= R, δ(R,1)= Q, δ(Q,0)= P, δ(Q,1)= S, P is both initial
and final state.
Construct the DFA : δ(q0,0) =q1, δ(q0,1)=q3, δ(q1,0)=q0, δ(q1,1)=q3, δ(q3,0)=q5,
δ(q3,1)=q5, δ(q5, 0)=q5, δ(q5, 1)=q5. q0 is initial state, q3 and q5are final states.

Construct the following NFA to its equivalent DFA. The moves are δ(q0, 0)=q0,
δ(q0, 1)=q1, δ(q1, 0)=q1, δ(q1, 1)=q1, δ(q1, 0)=q2, δ(q2, 0)=q2, δ(q2, 1)=q2,
δ(q2, 1)=q1. q1 is initial state. q2 is final state.
Construct the DFA and write the steps . The moves are δ(q1, 0)=q1, δ(q1, 1)=q2,
δ(q2, 1)=q2, δ(q2, 0)=q3, δ(q3, 0)=q3, δ(q3, 1)=q3. q1 is initial state. q1 and q2
are final states. Show the Transition Table
Define Mealy Machine and it's output characteristics.

The transition table of a NFA M is given in the following table. Construct a DFA
equivalent to M. Transitions are given as follows: δ(q0,0) =q1, δ(q0,0)=q4,
δ(q0,1)=q4, δ(q0,2)=q2, δ(q0,2)=q3, δ(q1,1)=q4, δ(q2,2)=q2, δ(q2,2)=q3,
δ(q3,1)=q4. q0 is initial and q3 is final state.
Convert the following PDA into an equivalent CFG. δ(q0,a0,z0)→(q1,z1z0),
δ(q0,b,z0)→(q1,z2z0), δ(q1,a,z1)→(q1,z1z1), δ(q1,b,z1)→(q1,λ),
δ(q1,b,z2)→(q1,z2z2)

Estimate the moves made by the DFA for the given NFA: The moves of the NFA
are: δ(q0,0)=q0, δ(q0,0)=q1, δ(q0,1)=q1, δ(q1,1)=q1, δ(q1,1)=q0. q0 is initial and
q1 is the final state.
Estimate the RE from the given FA. Given δ(q0,1)=q0, δ(q0,0)=q1, δ(q1,1)=q1,
δ(q1,0)=q2, δ(q2,0)=q1, δ(q2,1)=q0. q0 is initial and q2 is the final state.

Design a TM machine for checking the palindrome of the string of odd length.

Design a Turing machine to accept a Palindrome

Design a Turing machine that accepts {0^n

1^n | n>1}
Prove that the given language L=a^nb^n (where n>0)is not regular

Explain the Pumping Lemma for regular languages and its significance in the
theory of computation with an example demonstrating the application of the
Pumping Lemma.
Explain the process of converting a Non-Deterministic Finite Automaton (NFA) to
a Deterministic Finite Automaton (DFA). Discuss the key steps involved and
illustrate with an example.
Conclude the significance of converting an NFA to a DFA in the context of
computational theory. Explain this conversion aid in simplifying the analysis of
regular languages. Provide examples to support your explanation.
Illustrate the critical steps involved in each conversion and present the resulting
automaton : (a∣b) ∗ c to Non-deterministic Finite Automaton (NFA) .
Illustrate the critical steps involved in each conversion and present the resulting
automaton: (a∣b) ∗ c to Deterministic Finite Automaton (DFA) .
Explain the Pumping Lemma for regular languages, including its statements and
significance in proving that certain languages are not regular. Provide an
example to illustrate the application of the Pumping Lemma in demonstrating
the non-regularity of a language.

Illustrate a FA with ∑ = {0, 1} accepts even number of 0's and even number of
1's.

Illustrate a DFA L(M) = {w | w ε {0, 1}*} and W is a string that does not contain
consecutive 1's.

Illustrate an NFA in which all the string contain a substring 1110.

Illustrate an NFA in which all the string contain a substring 1110.

Illustrate an NFA with ∑ = {0, 1} accepts all string in which the third symbol from
the right end is always 0.

Estimate the minimized DFA.

Estimate the following Mealy machine into equivalent Moore machine.

Estimate the following Mealy machine into equivalent Moore machine.

Estimate the following Moore machine into its equivalent Mealy machine.

Estimate the following Moore machine into its equivalent Mealy machine.
Estimate the regular expression for the given DFA

Illustrate a Moore machine to generate 1's complement of a given binary

number.

Illustrate a Moore machine for a binary input sequence such that if it has a
substring 101, the machine output A, if the input has substring 110, it outputs B
otherwise it outputs C.
Illustrate a Moore machine with the input alphabet {0, 1} and output alphabet
{Y, N} which produces Y as output if input sequence contains 1010 as a substring
otherwise, it produces N as output.

Illustrate a Mealy machine for a binary input sequence such that if it has a
substring 101, the machine output A, if the input has substring 110, it outputs B
otherwise it outputs C.
Illustrate a mealy machine that scans sequence of input of 0 and 1 and
generates output 'A' if the input string terminates in 00, output 'B' if the string
terminates in 11, and output 'C' otherwise.

Predict using pumping lemma if a^n b^n c^n, for all n>=0 is context free or not.
Design a PDA for accepting a language {a^nb^2n | n>=1}.
Construct a PDA that accepts the language L over {0, 1} by empty stack which
accepts all the string of 0's and 1's in which a number of 0's are twice of number
of 1's.
Write the difference between Turing-Recognizable and Turing-Decidable
Languages

Construct a turing machine which accepts the language of "aba" over ∑ = {a, b}.

Construct a TM for the language L = {0n1n2n} where n≥1

Construct a TM machine for entering a $ as the 1st symbol in the tape, while
shifting the entire string one place to the right.
Construct TM for language over 0 and 1, that Ends with 101