Transformation from NFA to DFA Questions

MCQ bookmark_border

6.

What is the relation between NFA-accepted languages and DFA accepted languages?

A

>

B

<

C

<

D

<=

Correct Answer: C

The no of languages accepted by NFA and DFA is equal.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

7.

In regular expressions, the operator

A

Concatenation

B

Selection

C

Iteration

D

Iteration

Correct Answer: C

It indicates iterations which can vary from zero to any number.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

8.

A deterministic finite automation (DFA)D with alphabet ? = {a,b} is given below. Which of the following is a valid minimal DFA which accepts the same language as D?

A

B

C

D

Correct Answer: A

Two options are invalid because they both accept

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

9.

The lexical analysis for a modern language such as Java needs the power of which one of the following machine models in a necessary and sufficient sense?

A

Finite state automata

B

Deterministic pushdown automata

C

Non-deterministic pushdown automata

D

Turing machine

Correct Answer: A

Initially in lexical analysis the program is divided into tokens. Tokens can be expressed as regular expressions: [a-zA-Z] [a-zA-Z0-9]* the keyword if is given by if. Integers are given by [+-]? [0-9]+.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

10.

Is empty string a valid input in Ndfa.

A

True

B

True

C

>

Explanation : Empty strings can be inputted n a NDFA.

D

iv class="v-slide-group__next v-slide-group__next--disabled">

Explanation : Empty strings can be inputted n a NDFA.

Correct Answer: A

Empty strings can be inputted n a NDFA.