306 views
1 votes
1 votes
An nfa with multiple initial states is defined by the quintuple $M =(Q, Σ,δ,q0,F)$,
where $Q_0 ⊆ Q$ is a set of possible initial states. The language accepted by such an automaton is
defined as

$L (M)=$ {$w :δ^*(q0,w)$ contains $q_f$, for any $q_0 ∈ Q_0,q_f ∈ F$}

Show that for every nfa with multiple initial states there exists an nfa with a single initial state
that accepts the same language.

Also, Suppose that we made the restriction $Q_0 ∩ F= Ø$. Would this affect the
conclusion? (Question 19)

Please log in or register to answer this question.

Related questions

0 votes
0 votes
0 answers
2
0 votes
0 votes
1 answer
3
2 votes
2 votes
1 answer
4