College ID

College Name
Course Code
Course Title
Teacher Name
Teacher CNIC
Teacher Contact

Question _no Course Code

1 CSI-503
2 CSI-504
3 CSI-505
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
 37
38
39
40
41
42
43
44
45
46
47
48
49
50

Short question
1
2
Question_Text
------------------- is obviously infinite language.
The language Q is said to be quotient of two regular languages P and R, denoted by--- if PQ=R.   
Let Q = {aa, abaaabb, bbaaaaa, bbbbbbbbbb} and R = {b, bbbb, bbbaaa, bbbaaaaa}    Pref (Q in R) is equal to,         
If R is regular language and Q is any language (regular/ non regular), then Pref (Q in R) is ---------.
"CFG" stands for _________
___________ states are called the halt states.
In pumping lemma theorem (x y^n z) the range of n is
The PDA is called non-deterministic PDA when there are more than one out going edges from……… state
Grammatical rules which involve the meaning of words are called ---------------
The symbols that can’t be replaced by anything are called -----------------
The grammatical rules are often called_____________
The terminals are designated by ________ letters, while the non-terminals are designated by ________ letters.
Σ = {a,b} Productions S→XaaX          X→aX                   X→bX                   X→Λ This grammar defines the language
Who did not invent the Turing machine?
Let A = {0, 1}. The number of possible strings of length ‘n’ that can be formed by the elements of the set A is
Pumping lemma is generally used to prove that:
Left hand side of a production in CFG consists of:
Moore Machine is an application of:
Which of the following is a correct statement?
In mealy machine, the O/P depends upon?
The major difference between Mealy and Moore machine is about:
Can a DFA recognize a palindrome number?
Under which of the following operation, NFA is not closed?
Which statement is true?
L= language of words containing even number of a’s. Regular Expression is
___________ states are called the halt states
The reverse of the string sbfsbb over { sb, f, b}
The production S --> SS | a | b | ^ can be expressed by RE:
Which of the operations are eligible in PDA?
The minimum number of transitions to pass to reach the final state as per the following regular expression is: {
If NFA of 6 states excluding the initial state is converted into DFA, maximum possible number of states for the D
 NFA, in its name has ’non-deterministic’ because of :
The value of n if turing machine is defined using n-tuples:
 If d is not defined on the current state and the current tape symbol, then the machine ______
 What is the relation between DFA and NFA on the basis of computational power?
Which of the following conversion is not possible (algorithmically)?ot possible (algorithmically)?f the following co
Grammar that produce more than one Parse tree for same sentence is:
Which of the following regular expression identities are true ?
What is wrong in the given definition? Def: ({q0, q1, q2}, {0,1}, δ, q3, {q3})
Which one is a FALSE statement?
Grammars that can be translated to DFAs :
A Push Down Automata _______________ is if there is at most one transition applicable to each configuration?
Which among the following is not notated as infinite language?
Which of the following is a not a part of 5-tuple finite automata?
The maximum number of transition which can be performed over a state in a DFA? ∑= {a, b, c
The sum of minimum and maximum number of final states for a DFA n states is equal to:
Number of states require to accept string ends with 10.
Regular expression for all strings starts with ab and ends with bba is.
If L1 and L2 are regular sets then intersection of these two will be
Reverse of a DFA can be formed by

Write downd the types of finite state machines. Descibe their stucture form separately.
What is Non-Determinism and Determinism and what is the difference between them ?
 Superior College M.B.Din
CSI-404
Theory of Automata
Ateeq ur Rehman
34403-0494472-7
3035153000

Correct Option
PALINDROME
Q=R/P     
{b,bbba,bbbaaa}
Regular
Context Free Grammar
ACCEPT and REJECT
n=1, 2, 3, 4……….
READ or POP
Semantics
Terminals
Productions
Small, capital
(a+b)aa(a+b)
A. M. Turing
 n2
 A given language is not regular
Terminals and non-terminals
Finite automata with output
Moore machine has no accepting states
State and Input
Output Variations
Yes
Union
The tape of turing machine is infinite.
(b+ab*a)*
ACCEPT and REJECT
(bsbfsb)
(a+b)+
Push & Pop
4
128
The choice of path is non-deterministic
7
halts
 Equal
nondeterministic PDA to deterministic PDA
Ambiguous
(r + s)* = (r*s*)*
 Initial and Final states do not belong to the Graph
Every NDFA can be converted to a DFA
Right linear grammar
Deterministic
Factorial
Output Alphabet
3
n+1
3
ab(a+b)*bba
Regular
making final as starting state and starting state as final state
Option 2 Option 3
FACTORIAL EVEN-EVEN
R=Q/P   Q=P/R   
{b,bba,bbaaa} {ab,bba,bbbaa}
Non-regular Infinite
Context Free Graph Context Finite Graph
ACCEPT and READ ACCEPT AND START
n=0, 1, 2, 3, 4………. n=…….-3,-2,-1, 0, 1, 2, 3, 4……
START or READ POP or REJECT
Syntactic Productions
Non-terminals Productions
Terminals Non-terminals
Capital, bold Capital, small
(a+b)a(a+b)a (a+b)aa(a+b)aa
Alan Turing Turing
 nm 2n
A given language is infinite Either given RE equivalent or not
One terminal More than one terminal
Finite automata without input Non- Finite automata with output
Mealy machine has accepting states Convert Mealy to Moore
State Previous State
Input Variations State
No Yes, with input alphabet as ∑*
Kleene Negation
The tape of turing machine is finite. It is infinite when the language is regular
(a+b)*aa(a+b)* a+bb*aab*a
ACCEPT and READ ACCEPT AND START
bbfsb bfsbs
a-b (a-b)+
Delete Insert
5 6
64 32
The result is undetermined state to be transited next is non-deterministic
6 8
does not halts goes into loop forever
DFA > NFA NFA > DFA
nondeterministic TM to deterministic TM regular grammar to context-free grammar
Unambiguous Complementation
(r + s)* = r* s* (r + s)* = r* + s*
It does not satisfy 5 Tuple definition of NFA Initial and final states can’t be same
Complement of CFL is always recursive NFA can always are converted to a PDA
Left linear grammar Generic grammar
Non deterministic Finite
Palindrome Reverse
Input alphabet Transition function
4 2
n n-1
2 1
aba*b*bba ab(ab)*bba
Non Regular Recursive
using PDA making final state as non-final
Option 4
EQUAL-EQUAL
P=R/Q
{b,bba,bbba}
Equal
Context Finite Grammar
ACCEPT AND WRITE
n=…….-3,-2,-1, 1, 2, 3, 4……
PUSH or POP
None of given
All of above
None of given
Small, bold
(a+b)aba+b)
None of these
n!
None of these
One non-terminal
None of the mentioned
All of the mentioned
 Only Input
None of the mentioned
 Can’t be determined
Concatenation
It is infinite when the language is non regular
(a+b)*ab(a+b)*
ACCEPT AND WRITE
sbbfsb
None of them
None of them
3
127
All of the mentioned
5
none of the mentioned
Can’t be said
nondeterministic FSA to deterministic FSA
Concatenation Intersection
r* s* = r* + s*
There are no transition definition
There exists a unique DFA for every regular language
All of the mentioned
Non finite
L={ab}*
Initial State
1
n+2
can’t be represented.
All of the mentioned
Non Recursive
None of the mentioned