In the tuples which is used to represent an automata Q represents the states in the automataa.falseb.true

Languages are conditions in forming strings over the symbols available in the alphabet seta.trueb.may be true in some casesc.falsed.may be false in most of the cases

1. There are ________ tuples in finite state machine.a) 4b) 5c) 6d) unlimited

NFA doesn’t require to show transitions for all input symbols in alphabet set over a statea.trueb.false

19. Consider the following modification of Definition 2.6. An nfa with multipleinitial states is defined by the quintupleM = (Q, Σ, δ, Q0, F ) ,58 Chapter 2 Finite Automatawhere Q0 ⊆ Q is a set of possible initial states. The language accepted bysuch an automaton is defined asL (M ) = {w : δ∗ (q0, w) contains qf , for any q0 ∈ Q0, qf ∈ F } .Show that for every nfa with multiple initial states there exists an nfa with asingle initial state that accepts the same language.20. Suppose that in Exercise 19 we made the restriction Q0 ∩ F = . Would thisaffect the conclusion?

Every state-machine diagram must have an origin state and a destination state.Question 5Select one:True.False.