Question 1

A universal Turing machine is a

Accepted Answer

A) reprogrammable truing machine 
B) two-tape turing machine 
C) single tape turing machine 
D) none of them 
A) reprogrammable truing machine 
B) two-tape turing machine 
C) single tape turing machine 
D) none of them A

Question 2

The language L = {anbnan n? 1} is recognized by

Accepted Answer

A) turing machine 
B) 2 pushdown automata 
C) post machine 
D) all are correct 
A) turing machine 
B) 2 pushdown automata 
C) post machine 
D) all are correct D

Question 3

A random access machine (RAM) and truing machine are different in

Accepted Answer

A) power 
B) accessing 
C) storage 
D) both accessing and storage are correct 
A) power 
B) accessing 
C) storage 
D) both accessing and storage are correct D

Question 4

The set that can be recognized by a deterministic finite state automaton is

Accepted Answer

A) The set {1, 101, 11011, 1110111, …….} 
B) The set of binary string in which the number of 0's is same as the number of1's 
C) 1, 2, 4, 8……2n ….. written in binary 
D) 1, 2, 4, 8……2n ….. written in unary 
A) The set {1, 101, 11011, 1110111, …….} 
B) The set of binary string in which the number of 0's is same as the number of1's 
C) 1, 2, 4, 8……2n ….. written in binary 
D) 1, 2, 4, 8……2n ….. written in unary

Question 5

Universal Turing machine (UTM) influenced the concepts of

Accepted Answer

A) computability 
B) interpretive implementation of programming language 
C) program and data is in same memory 
D) all are correct 
A) computability 
B) interpretive implementation of programming language 
C) program and data is in same memory 
D) all are correct

Question 6

Which of the following conversion is not possible (algorithmically)?

Accepted Answer

A) regular grammar to context-free grammar 
B) non-deterministic finite state automata to deterministic finite state automata 
C) non-deterministic pushdown automata to deterministic pushdown automata 
D) none deterministic turing machine to deterministic turing machine 
A) regular grammar to context-free grammar 
B) non-deterministic finite state automata to deterministic finite state automata 
C) non-deterministic pushdown automata to deterministic pushdown automata 
D) none deterministic turing machine to deterministic turing machine

Question 7

If Turing machine accepts all the words of the languages L and rejects or loops for other words, which are not in L, then L is said to be

Accepted Answer

A) recursive enumerable 
B) recursive 
C) context free language (cfl) 
D) none of them 
A) recursive enumerable 
B) recursive 
C) context free language (cfl) 
D) none of them

Question 8

Which is correct regard an off-line Truing machine?

Accepted Answer

A) an offline turing machine is a special type of multi-tape turing machine 
B) an offline turing machine is a kind of multi-tracks truing machine 
C) an offline turing machine is a kind of single-track turing machine 
D) none of them 
A) an offline turing machine is a special type of multi-tape turing machine 
B) an offline turing machine is a kind of multi-tracks truing machine 
C) an offline turing machine is a kind of single-track turing machine 
D) none of them

Question 9

Given S = {a, b}, which one of the following sets is not countable?

Accepted Answer

A) the set all strings over ? 
B) the set of all language over ? 
C) the set of all binary strings 
D) the set of all languages over ? accepted by turing machines 
A) the set all strings over ? 
B) the set of all language over ? 
C) the set of all binary strings 
D) the set of all languages over ? accepted by turing machines

Question 10

He difference between a read-only Turing machine and a two-way finite state machine is

Accepted Answer

A) head movement 
B) finite control 
C) storage capacity 
D) power 
A) head movement 
B) finite control 
C) storage capacity 
D) power

Question 11

In which of the stated below is the following statement true? "For every non-deterministic machine M1, there exists as equivalent deterministic machine M2 recognizing the same language."

Accepted Answer

A) m1 is a non-deterministic finite automata 
B) m1 is a non-deterministic push-down automata 
C) m1 is a non-deterministic turing machine 
D) for no machine m1 use the above statement true 
A) m1 is a non-deterministic finite automata 
B) m1 is a non-deterministic push-down automata 
C) m1 is a non-deterministic turing machine 
D) for no machine m1 use the above statement true

Question 12

Choose the correct statement

Accepted Answer

A) recursive set ? recursive enumerable set 
B) total function is same as partial function 
C) recursive sets are analogous to total functions 
D) both recursive set ? recursive enumerable set and recursive sets are analogous to total functions are correct. 
A) recursive set ? recursive enumerable set 
B) total function is same as partial function 
C) recursive sets are analogous to total functions 
D) both recursive set ? recursive enumerable set and recursive sets are analogous to total functions are correct.

Question 13

The set which is not countable if we have ? = {a, b}, is

Accepted Answer

A) Set of all languages over ? accepted by turing machine 
B) Set of all regular languages over ? 
C) Set of all strings over ? 
D) Set of all languages over ? 
A) Set of all languages over ? accepted by turing machine 
B) Set of all regular languages over ? 
C) Set of all strings over ? 
D) Set of all languages over ?

Question 14

What is the reason behind a Turing machine is more powerful than finite state machine FSM?

Accepted Answer

A) turing machine head movement is continued to one direction. 
B) turing machine head moment is in both directions i.e. left moment and right moment as well. 
C) turing machine has capability remember arbitrary long sequence of input string. 
D) all are correct. 
A) turing machine head movement is continued to one direction. 
B) turing machine head moment is in both directions i.e. left moment and right moment as well. 
C) turing machine has capability remember arbitrary long sequence of input string. 
D) all are correct.

Question 15

The number of symbols necessary to simulate a Turing machine with m symbols and n states

Accepted Answer

A) 4m × n + m 
B) 4m × n + n 
C) m+n 
D) none of them 
A) 4m × n + m 
B) 4m × n + n 
C) m+n 
D) none of them

Question 16

If a Turing machine halts for each and every world of a language L and rejects other, then L is said to be

Accepted Answer

A) recursive enumerable 
B) recursive 
C) context free language 
D) none of these 
A) recursive enumerable 
B) recursive 
C) context free language 
D) none of these

Question 17

Which of the following statement is wrong?

Accepted Answer

A) power of ntm and tm is same 
B) for n ? 2, npda has some power as a tm 
C) for n ? 2, npda and 2pda have same power 
D) power of ntm and tm is not same 
A) power of ntm and tm is same 
B) for n ? 2, npda has some power as a tm 
C) for n ? 2, npda and 2pda have same power 
D) power of ntm and tm is not same

Question 18

A pushdown automata behaves like a Turing machine, when it has number of auxiliary/ memory.

Accepted Answer

A) 0 
B) exectly 2 
C) 2 or more 
D) both exectly 2 or more are correct 
A) 0 
B) exectly 2 
C) 2 or more 
D) both exectly 2 or more are correct

Question 19

Church's Thesis supports

Accepted Answer

A) a turing machine as a general-purpose computer system 
B) a turing machine an algorithm and an algorithm as a turing machine 
C) both tm is an general-purpose computer and tm is an algorithm and vice-versa are correct 
D) none of them is correct 
A) a turing machine as a general-purpose computer system 
B) a turing machine an algorithm and an algorithm as a turing machine 
C) both tm is an general-purpose computer and tm is an algorithm and vice-versa are correct 
D) none of them is correct

Question 20

We think of a Turing machine's transition function as a

Accepted Answer

A) computer system 
B) software 
C) hardware 
D) all of them 
A) computer system 
B) software 
C) hardware 
D) all of them

A universal Turing machine is a

The language L = {anbnan n? 1} is recognized by

A random access machine (RAM) and truing machine are different in

The set that can be recognized by a deterministic finite state automaton is

Universal Turing machine (UTM) influenced the concepts of

Which of the following conversion is not possible (algorithmically)?

If Turing machine accepts all the words of the languages L and rejects or loops for other words, which are not in L, then L is said to be

Which is correct regard an off-line Truing machine?

Given S = {a, b}, which one of the following sets is not countable?

He difference between a read-only Turing machine and a two-way finite state machine is

In which of the stated below is the following statement true? "For every non-deterministic machine M1, there exists as equivalent deterministic machine M2 recognizing the same language."

Choose the correct statement

The set which is not countable if we have ? = {a, b}, is

What is the reason behind a Turing machine is more powerful than finite state machine FSM?

The number of symbols necessary to simulate a Turing machine with m symbols and n states

If a Turing machine halts for each and every world of a language L and rejects other, then L is said to be

Which of the following statement is wrong?

A pushdown automata behaves like a Turing machine, when it has number of auxiliary/ memory.

Church's Thesis supports

We think of a Turing machine's transition function as a

Formal Languages and Automata Theory: Part A

Formal Languages and Automata Theory: Part B

Computational Theory : Grammar, Language, and Complexity

Omputer Science and Theory of Computation

Filters

Exam 5: Automata and Turing Machines

A universal Turing machine is a

The language L = {anbnan n? 1} is recognized by

A random access machine (RAM) and truing machine are different in

The set that can be recognized by a deterministic finite state automaton is

Universal Turing machine (UTM) influenced the concepts of

Which of the following conversion is not possible (algorithmically)?

If Turing machine accepts all the words of the languages L and rejects or loops for other words, which are not in L, then L is said to be

Which is correct regard an off-line Truing machine?

Given S = {a, b}, which one of the following sets is not countable?

He difference between a read-only Turing machine and a two-way finite state machine is

In which of the stated below is the following statement true? "For every non-deterministic machine M1, there exists as equivalent deterministic machine M2 recognizing the same language."

Choose the correct statement

The set which is not countable if we have ? = {a, b}, is

What is the reason behind a Turing machine is more powerful than finite state machine FSM?

The number of symbols necessary to simulate a Turing machine with m symbols and n states

If a Turing machine halts for each and every world of a language L and rejects other, then L is said to be

Which of the following statement is wrong?

A pushdown automata behaves like a Turing machine, when it has number of auxiliary/ memory.

Church's Thesis supports

We think of a Turing machine's transition function as a

Formal Languages and Automata Theory: Part A

Formal Languages and Automata Theory: Part B

Computational Theory : Grammar, Language, and Complexity

Omputer Science and Theory of Computation

Filters