Test: Non Deterministic Finite Automata - Computer Science Engineering (CSE) MCQ

Statement 1 is true and Statement 2 is true

Statement 1 is true and Statement 2 is false

Statement 1 can be true and Statement 2 is true

Statement 1 is false and Statement 2 is also false

2

3

4

1

Acceptor

Classifier

Transducer

None of the mentioned.

64

32

128

127

The result is undetermined

The choice of path is non-deterministic

The state to be transited next is non-deterministic

All of the mentioned

Statement 1 is correct because Statement 2 is correct

Statement 2 is correct because Statement 2 is correct

Statement 2 is false and Statement 1 is false

Statement 1 is false because Statement 2 is false

2

3

4

Cannot be determined.

O(m2)

O(2m)

O(m)

e)is:a) O(m2)b) O(2m)c) O(m)

1/m2

2m

1/m

log m

NFA is slower to process and its representation uses more memory than DFA

DFA is faster to process and its representation uses less memory than NFA

NFA is slower to process and its representation uses less memory than DFA

DFA is slower to process and its representation uses less memory than NFA