FLAT UNIT1 S8

Which of the following is not a part of 5-tuple finite automata?

• Input alphabet
  

• Transition function

• Initial State

• Output Alphabet

• Final state with loop x

• Transitional state with loop x

• Initial state as well as final state with loop x

• Insufficient Data

• ababaabaa

• abbbaa

• abbbaabb

• abbaabbaa

• ε

• 11010

• 10001010

• String of letter count 11

The password to the admins account=”administrator”. The total number of states required to make a password-pass system using DFA would be __________

• 14 states

• 13 states

• 12 states

• A password pass system cannot be created using DFA

Let ∑= {a, b, …. z} and A = {Hello, World}, B= {Input, Output}, then (A*∩B) U (B*∩A) can be represented as:

• {Hello, World, Input, Output, ε}

• {Hello, World, ε}

• {Input, Output, ε}

• {}

There are ________ tuples in finite state machine.

• 4

• 5

• 6

• UNLIMITED

Transition function maps.

• Σ * Q -> Σ

• Q * Q -> Σ

• Σ * Σ -> Q

• Q * Σ -> Q

Number of states require to accept string ends with 10.

• 1

• 2

• 3

• 4

SAY THE FEEDBACK ABOUT CLASS?