Question

Please help with Exercise 1, automata definition

Find the formal definition of the automaton below:

Answer 1

A ε-NFA is a quintuple A=(Q,Σ,,q₀,F) where

null

– Q is a set of states

Q = { 1, 2,3,4,5}

– Σ is the alphabet of input symbols

Σ = { a,b,c}

– q₀∈Q is the initial state

q_{0 = {1}}

– F ⊆ Q is the set of final states

F = {4}

-– $\delta$ : Q × Σε → P(Q) is the transition function

The transition function   can be written as follows:

null

States	∈	a	b	c
1	∅	2	5	∅
2	{3,5}	∅	∅	∅
3	∅	∅	5	∅
4	∅	∅	∅	2
5	∅	∅	∅	4