Non Deterministic Finite Automata Questions

MCQ bookmark_border

11.

The regular languages are not closed under ___________

A

Concatenation

B

Union

C

Kleene star

D

Complement

Correct Answer: D

RE are closed under Union (cf. picture) Intersection Concatenation Negation Kleene closure.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

12.

The regular languages are not closed under ___________

A

Concatenation

B

Union

C

Kleene star

D

Complement

Correct Answer: D

RE are closed under Union (cf. picture) Intersection Concatenation Negation Kleene closure.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

13.

The regular languages are not closed under ___________

A

Concatenation

B

Union

C

Kleene star

D

Complement

Correct Answer: D

RE are closed under Union (cf. picture) Intersection Concatenation Negation Kleene closure.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

14.

The Tuples for NDFA is ___________

A

?, Q, q0, F, ?

B

Q, q0, F, ?

C

?, Q, q0, F,?

D

F, Q, ?, q0, ?

Correct Answer: A

An NFA is represented formally by a 5-tuple, (Q, ?, ?, q0, F), of a set of states Q a set of input symbols ? a transition function ? : Q

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

15.

The Tuples for NDFA is ___________

A

?, Q, q0, F, ?

B

Q, q0, F, ?

C

?, Q, q0, F,?

D

F, Q, ?, q0, ?

Correct Answer: A

An NFA is represented formally by a 5-tuple, (Q, ?, ?, q0, F), of a set of states Q a set of input symbols ? a transition function ? : Q

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

16.

The Tuples for NDFA is ___________

A

?, Q, q0, F, ?

B

Q, q0, F, ?

C

?, Q, q0, F,?

D

F, Q, ?, q0, ?

Correct Answer: A

An NFA is represented formally by a 5-tuple, (Q, ?, ?, q0, F), of a set of states Q a set of input symbols ? a transition function ? : Q

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

17.

NFAs are ________ DFAs.

A

Larger than

B

More expressive than

C

Less expressive than

D

Equally expressive as

Correct Answer: A

Because there is more number of states for an NDFA than for a DFA for a given expression.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

18.

An NFA

A

A Boolean value

B

A state

C

A set of states

D

An edge

Correct Answer: C

A transition function ?: Q

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

19.

A transition function ?: Q

A

Is impossible

B

Requires the subset construction

C

Is Chancy

D

Is nondeterministic

Correct Answer: B

In order to convert NDFA to DFA we work with sets of state where each state in the DFA corresponds to a set of NFA states.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

20.

A regular language corresponds to __________

A

An alphabet

B

Set of strings over an alphabet

C

A DFA only

D

A DFA or an NFA

Correct Answer: B

A regular grammar takes in all strings over an alphabet.

Check Answer report_problem Report forum Discussion