Finite Automata Questions

MCQ bookmark_border

31.

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

32.

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

33.

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

34.

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

35.

Assume the R is a relation on a set A, aRb is partially ordered such that a and b are _____________

A

reflexive

B

transitive

C

symmetric

D

reflexive and transitive

Correct Answer: D

A partially ordered relation refers to one which is Reflexive, Transitive and Antisymmetric.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

36.

The non- Kleene Star operation accepts the following string of finite length over set A = {0,1} | where string s contains even number of 0 and 1

A

01,0011,010101

B

0011,11001100

C

?,0011,11001100

D

?,0011,11001100

Correct Answer: B

The Kleene star of A, denoted by A*, is the set of all strings obtained by concatenating zero or more strings from A.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

37.

A regular language over an alphabet ? is one that cannot be obtained from the basic languages using the operation

A

Union

B

Concatenation

C

Kleene*

D

All of the mentioned

Correct Answer: D

Union, Intersection, Concatenation, Kleene*, Reverse are all the closure properties of Regular Language.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

38.

Statement 1: A Finite automata can be represented graphically; Statement 2: The nodes can be its states; Statement 3: The edges or arcs can be used for transitions
Hint: Nodes and Edges are for trees and forests too.
Which of the following make the correct combination?

A

Statement 1 is false but Statement 2 and 3 are correct

B

Statement 1 and 2 are correct while 3 is wrong

C

None of the mentioned statements are correct

D

All of the mentioned

Correct Answer: D

It is possible to represent a finite automaton graphically, with nodes for states, and arcs for transitions.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

39.

The minimum number of states required to recognize an octal number divisible by 3 are/is

A

1

B

3

C

5

D

7

Correct Answer: B

According to the question, minimum of 3 states are required to recognize an octal number divisible by 3.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

40.

Which of the following is not a part of 5-tuple finite automata?

A

Input alphabet

B

Transition function

C

Initial State

D

Output Alphabet

Correct Answer: D

A FA can be represented as FA = (Q, ?, ?, q0, F) where Q=Finite Set of States, ?=Finite Input Alphabet, ?=Transition Function, q0=Initial State, F=Final/Acceptance State).

Check Answer report_problem Report forum Discussion