Question 1

FSM can recognize

Accepted Answer

A) Any grammar 
B) Only CG 
C) Both (a) and ( b ) 
D) Only regular grammar 
A) Any grammar 
B) Only CG 
C) Both (a) and ( b ) 
D) Only regular grammar

Question 2

Consider the following Finite State Automaton The language accepted by this automaton is given by the regular expression

Accepted Answer

A) b*ab*ab*ab 
B) (a+b)* 
C) b*a(a+b)* 
D) b*ab*ab 
A) b*ab*ab*ab 
B) (a+b)* 
C) b*a(a+b)* 
D) b*ab*ab

Question 3

PCP is:

Accepted Answer

A) Decidable 
B) Undecidable 
C) Sometimes Decidable 
D) None of the 
A) Decidable 
B) Undecidable 
C) Sometimes Decidable 
D) None of the

Question 4

Which one of the following is true regarding FOTRAN?

Accepted Answer

A) It is a context free language 
B) It is a context sensitive language 
C) It is a regular language 
D) None of the above 
A) It is a context free language 
B) It is a context sensitive language 
C) It is a regular language 
D) None of the above

Question 5

Recursively enumerable languages are not closed under

Accepted Answer

A) Union 
B) homomorphism 
C) complementation 
D) concatenation 
A) Union 
B) homomorphism 
C) complementation 
D) concatenation

Question 6

Given A = {0,1} and L = A*. If R = (0n1n, n > 0), then language L ? R and R are respectively

Accepted Answer

A) Regular, regular 
B) Not regular, regular 
C) Regular, not regular 
D) Context free, not regular 
A) Regular, regular 
B) Not regular, regular 
C) Regular, not regular 
D) Context free, not regular

Question 7

A minimum state deterministic finite automation accepting the language L = {W W € {0,1}* , number of 0's and 1's in W are divisible by 3 and 5 respectively has

Accepted Answer

A) 15 states 
B) 11 states 
C) 10 states 
D) 9 states 
A) 15 states 
B) 11 states 
C) 10 states 
D) 9 states

Question 8

Let L={w (0 + 1)* w has even number of 1s}, i.e. L is the set of all bit strings with even number of 1s. Which one of the regular expression below represents L?

Accepted Answer

A) (0*10*1)* 
B) 0*(10*10*)* 
C) 0*(10*1*)*0* 
D) 0*1(10*1)*10* 
A) (0*10*1)* 
B) 0*(10*10*)* 
C) 0*(10*1*)*0* 
D) 0*1(10*1)*10*

Question 9

Which of the following statements is/are FALSE?
(1) For every non-deterministic Turing machine, there exists an equivalent deterministic Turing machine.
(2) Turing recognizable languages are closed under union and complementation.
(3) Turing decidable languages are closed under intersection and complementation
(4) Turing recognizable languages are closed under union and intersection.

Accepted Answer

A) 1 and 4 only 
B) 1 and 3 only 
C) 2 only 
D) 3 only 
A) 1 and 4 only 
B) 1 and 3 only 
C) 2 only 
D) 3 only

Question 10

Which of the following are decidable?
1) Whether the intersection of two regular language is infinite.
2) Whether a given context free language is regular.
3) Whether two push down automata accept the same language.
4) Whether a given grammar is context free.

Accepted Answer

A) 1 and 2 
B) 1 and 4 
C) 2 and 3 
D) 2 and 4 
A) 1 and 2 
B) 1 and 4 
C) 2 and 3 
D) 2 and 4

FSM can recognize

Consider the following Finite State Automaton The language accepted by this automaton is given by the regular expression

PCP is:

Which one of the following is true regarding FOTRAN?

Recursively enumerable languages are not closed under

Given A = {0,1} and L = A*. If R = (0n1n, n > 0), then language L ? R and R are respectively

A minimum state deterministic finite automation accepting the language L = {W W € {0,1}* , number of 0's and 1's in W are divisible by 3 and 5 respectively has

Let L={w (0 + 1)* w has even number of 1s}, i.e. L is the set of all bit strings with even number of 1s. Which one of the regular expression below represents L?

Which of the following are decidable? 1) Whether the intersection of two regular language is infinite. 2) Whether a given context free language is regular. 3) Whether two push down automata accept the same language. 4) Whether a given grammar is context free.

Formal Languages and Automata Theory: Part A

Computational Theory : Grammar, Language, and Complexity

Omputer Science and Theory of Computation

Automata and Turing Machines

Filters

Exam 2: Formal Languages and Automata Theory: Part B

FSM can recognize

Consider the following Finite State Automaton The language accepted by this automaton is given by the regular expression

PCP is:

Which one of the following is true regarding FOTRAN?

Recursively enumerable languages are not closed under

Given A = {0,1} and L = A*. If R = (0n1n, n > 0), then language L ? R and R are respectively

A minimum state deterministic finite automation accepting the language L = {W W € {0,1}* , number of 0's and 1's in W are divisible by 3 and 5 respectively has

Let L={w (0 + 1)* w has even number of 1s}, i.e. L is the set of all bit strings with even number of 1s. Which one of the regular expression below represents L?

Which of the following are decidable? 1) Whether the intersection of two regular language is infinite. 2) Whether a given context free language is regular. 3) Whether two push down automata accept the same language. 4) Whether a given grammar is context free.

Formal Languages and Automata Theory: Part A

Computational Theory : Grammar, Language, and Complexity

Omputer Science and Theory of Computation

Automata and Turing Machines

Filters