Finite Automata Questions

MCQ bookmark_border

11.

Regular expression for all strings starts with ab and ends with bba is.

A

aba*b*bba

B

ab(ab)*bba

C

ab(a+b)*bba

D

All of the mentioned

Correct Answer: C

Starts with ab then any number of a or b and ends with bba.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

12.

. How many DFA

A

16

B

26

C

32

D

64

Correct Answer: D

Number of DFA

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

13.

The basic limitation of finite automata is that

A

It can

B

It sometimes recognize grammar that are not regular.

C

It sometimes fails to recognize regular grammar.

D

All of the mentioned

Correct Answer: A

Because there is no memory associated with automata.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

14.

Number of states require to simulate a computer with memory capable of storing

A

3 * 2⁸

B

2^(3*8)

C

2⁽³⁺⁸⁾

D

None of the mentioned

Correct Answer: B

2(m*n) states requires.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

15.

FSM with output capability can be used to add two given integer in binary representation. This is

A

True

B

False

C

May be true

D

None of the mentioned

Correct Answer: A

Use them as a flip flop output.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

16.

 In finite automata, Q stands for?

A

Finite set of input symbols

B

Transition function

C

Finite set of states

D

One Start state

Correct Answer: C

The mathematical model of finite automata : Finite set of states (Q).

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

17.

 Languages of a automata is

A

If it halts

B

If it is accepted by automata

C

If automata touch final state in its life time

D

All language are language of automata

Correct Answer: B

If a string accepted by automata it is called language of automata.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

18.

Language of finite automata is

A

Type 0

B

Type 1

C

Type 2

D

Type 3

Correct Answer: D

According to Chomsky classification

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

19.

The basic limitation of finite automata is that

A

it can

B

it sometimes recognize grammar that are not regular

C

it sometimes fails to recognize regular grammar

D

None of the above

Correct Answer: A

Because there is no memory associated with automata.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

20.

There are ________ tuples in finite state machine.

A

4

B

5

C

6

D

unlimited

Correct Answer: B

States, input symbols, initial state, accepting state and transition function.

Check Answer report_problem Report forum Discussion