Intro to Finite State Machines

There are ________ tuples in finite state machine.

• 4

• 5

• 6

• 7

Transition function maps.

• Σ * Q -> Σ

• Q * Q -> Σ

• Σ * Σ -> Q

• Q * Σ -> Q

Language of finite automata is.

• Type 0

• Type 1

• Type 2

• Type 3

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.

• 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

An automaton that presents output based on previous state or current input:

• Acceptor

• Classifier

• Transducer

• None of the mentioned.

NFA, in its name has ’non-deterministic’ because of :

• The result is undetermined

• The choice of path is non-deterministic

• The state to be transited next is non-deterministic

• All of the mentioned

The DFA shown below accepts the set of all strings over {0, 1} that

• Contain the substring 00

• End with 00

• End with 0

• Begin either with 0 or 1

From current state, on reading input symbol, it moves to more than one state

• DFA

• DFA with epsilon transitions

• NFA

If a language L is accepted by NFA, then there exist a DFA to accept L

• Yes

• No

Equivalent automata that accepts regular language is

• Turing Machine

• Linear Bounded Automata

• Push Down Automata

• Finite Automata