How do I convert a 5-tuple NFA to a diagram?

Question

The only information I have is a nondeterministic finite automaton $(K, \Sigma, \Delta, s, F)$ where:

$$K = {p, q, r}\ \Sigma = {a, b, c}\ s = p\ F = {q}\ \Delta = {(p, a, q), (q, b

Answer 1

You can read it off directly from $\Delta$. You have three states, $p$, $q$, and $r$. $\Delta$ shows that there are just four transitions: $p\overset{a}\longrightarrow q$, $q\overset{a}\longrightarrow p$, $q\overset{b}\longrightarrow r$, and $r\overset{c}\longrightarrow q$. The initial state is $p$, and the only acceptor (or final) state is $q$. Just draw your three states, mark the initial and acceptor states, and draw in the four transition arrows.

And this is actually a DFA, so it should be very easy to work with.