This denotes the type of an automaton. States are unsigned integers, and inputs and outputs symbols are listed as strings, where outputs can be simply empty. Hence, the transitions are tuples (s1,a,b,s2) where state s1 makes a transition to state s2 when reading input letter a and then outputs b. The automaton may also have accepting states which can be also endowed with inputs to model edge automata.