Deck 5: Automata and Turing Machines

Question 1

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

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 ?

Answer 1

Set of all languages over ?

Question 2

How many states are present in the minimum state finite automaton that recognizes the language represented by the regular expression (0+1)(0+1)…..N times?

A)n+1
B)n+2
C)n
D)2n

Answer 2

n+2

Question 3

Consider the state table of a finite state machine that has input x and a single output z. The shortest input sequence to reach the final state C if the initial state is unknown is

A)10
B)01
C)101
D)110

Answer 3

10

Question 4

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

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

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

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 6

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

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

Question 7

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

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

Question 8

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

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

Question 9

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

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

Question 10

Universal Turing machine (UTM) influenced the concepts of

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

Question 11

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

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

Question 12

A universal Turing machine is a

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

Question 13

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

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

Question 14

Which is correct regard an off-line Truing machine?

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 15

Which of the following statement is wrong?

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 16

Four pairs are following; in each pair both objects have some common thing. Choose the odd pair;

A)(tm, 2pda)
B)(computer, utm)
C)(2pda, npda)
D)(fa, pda)

Question 17

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

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

Question 18

Church's Thesis supports

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 19

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

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

Question 20

Choose the correct statement

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 21

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

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 22

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."

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 23

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

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