Is an ordinary NFA and a NFA-ε are equivalent.

Which of the following statement(s) is/are TRUE? (i) For every NFA with an arbitrary number of final states, there is an equivalent NFA with only one final state. (ii) A language that is accepted by a DFA will also be accepted by some NFA.

A

Neither (i) nor (ii)

B

Only (i)

C

Only (ii)

D

Both (i) and (ii)

What is the price range of ordinary wall clocks ? I. The price range of ordinary wrist watches of company X is Rs 400 to Rs 600. II. The price range of ordinary wall clocks of company X is 50 percent that of their ordinary watches.

A

If the data in statement I alone are sufficient to answer the question

B

If the data in statement II alone are sufficient answer the question

C

If the data either in I or II alone are sufficient to answer the question;

D

If the data even in both the statements together are sufficient to answer the question

For an automata, which of the following are equivalent variants? DFA,NFA and NFA with epsilon transitions

A

DFA and NFA

B

NFA and epsilon NFA

C

DFA and epsilon NFA

D

All of the mentioned

State true or false: Statement: Both NFA and e-NFA recognize exactly the same languages.

A

true

B

false

Consider the following two statements: I. If all states of an NFA are accepting states then the language accepted by the NFA is ∑*. II. There exists a regular language A such that for all languages B, A ∩ B is regular. Which one of the following is CORRECT?

A

Only I is true

B

Only II is true

C

Both I and II are true

D

Both I and II are false

NFA-εs are defined because certain properties can be more easily proved on them as compared to NFA.

A

True

B

False

An NFA is nothing more than an ε-NFA with no ε transitions.

A

True

B

False

Which of the following options is correct? Statement 1: Initial State of NFA is Initial State of DFA. Statement 2: The final state of DFA will be every combination of final state of NFA.

A

Statement 1 is true and Statement 2 is true

B

Statement 1 is true and Statement 2 is false

C

Statement 1 can be true and Statement 2 is true

D

Statement 1 is false and Statement 2 is also false

Statement 1: NFA computes the string along parallel paths. Statement 2: An input can be accepted at more than one place in an NFA. Which among the following options are most appropriate?

A

Statement 1 is true while 2 is not

B

Statement 1 is false while is not

C

Statement 1 and 2, both are true

D

Statement 1 and 2, both are false

The given NFA represents which of the following NFA

A

(ab U ] *

B

(a*b* U a*)

C

(ab U a*)

D

(ab)* U a*

Is an ordinary NFA and a NFA-ε are equivalent.

Related Questions