Question 1

The languages -------------- are the examples of non regular languages.

Accepted Answer

A) PALINDROME and PRIME 
B) PALINDROME and EVEN-EVEN 
C) EVEN-EVEN and PRIME 
D) FACTORIAL and SQURE 
A) PALINDROME and PRIME 
B) PALINDROME and EVEN-EVEN 
C) EVEN-EVEN and PRIME 
D) FACTORIAL and SQURE

Question 2

___________ states are called the halt states.

Accepted Answer

A) ACCEPT and REJECT 
B) ACCEPT and READ 
C) ACCEPT AND START 
D) ACCEPT AND WRITE 
A) ACCEPT and REJECT 
B) ACCEPT and READ 
C) ACCEPT AND START 
D) ACCEPT AND WRITE

Question 3

Let L1 be a recursive language, and let L2 be a recursively enumerable but not a recursive language. Which one of the following is TRUE?

Accepted Answer

A) ( L1)' is recursive and (L2)' is recursively enumerable 
B) ( L1)' is recursive and (L2)' is not recursively enumerable 
C) ( L1)' and (L2)' are recursively enumerable 
D) ( L1)' is recursively enumerable and (L2)' is recursive 
A) ( L1)' is recursive and (L2)' is recursively enumerable 
B) ( L1)' is recursive and (L2)' is not recursively enumerable 
C) ( L1)' and (L2)' are recursively enumerable 
D) ( L1)' is recursively enumerable and (L2)' is recursive

Question 4

Consider the regular language L =(111+11111)*. The minimum number of states in any DFA accepting this languages is:

Accepted Answer

A) 3 
B) 5 
C) 8 
D) 9 
A) 3 
B) 5 
C) 8 
D) 9

Question 5

The PDA is called non-deterministic PDA when there are more than one out going edges from……… state

Accepted Answer

A) START or READ 
B) POP or REJECT 
C) READ or POP 
D) PUSH or POP 
A) START or READ 
B) POP or REJECT 
C) READ or POP 
D) PUSH or POP

The languages -------------- are the examples of non regular languages.

___________ states are called the halt states.

Let L₁ be a recursive language, and let L₂ be a recursively enumerable but not a recursive language. Which one of the following is TRUE?

Consider the regular language L =(111+11111)*. The minimum number of states in any DFA accepting this languages is:

The PDA is called non-deterministic PDA when there are more than one out going edges from……… state

Formal Languages and Automata Theory: Part A

Formal Languages and Automata Theory: Part B

Omputer Science and Theory of Computation

Automata and Turing Machines

Filters

Exam 3: Computational Theory : Grammar, Language, and Complexity

The languages -------------- are the examples of non regular languages.

___________ states are called the halt states.

Let L1 be a recursive language, and let L2 be a recursively enumerable but not a recursive language. Which one of the following is TRUE?

Consider the regular language L =(111+11111)*. The minimum number of states in any DFA accepting this languages is:

The PDA is called non-deterministic PDA when there are more than one out going edges from……… state

Formal Languages and Automata Theory: Part A

Formal Languages and Automata Theory: Part B

Omputer Science and Theory of Computation

Automata and Turing Machines

Filters

Let L₁ be a recursive language, and let L₂ be a recursively enumerable but not a recursive language. Which one of the following is TRUE?