n i j a ...Where n is the number of states, and each line i j a is a transition from state i to state j on input character a.
We assume that states are known by number 0, 1, ... , n-1. We assume that 0 is the initial state and 1 is the unique final state. Multiple final states can be handled by epsilon moves to state 1.
We assume the input alphabet is a, b, ..., z and reserve the dash character to represent and epsilon move.