Let's consider the given subrecursive automaton

$($AB$).$ AB$=(\{$s$,$ q$,$ f$\},\{$a$,$ b$\},\{$a$,$ b$,$ Z$0\},,$ s$,$ Z$0,$ f$)($s$,$ a$,$ Z$0)=\{($s $,$ aZ$0)\}($s$,$ a$,$ a$)=\{($s $,$ aa$)\}($s$,$ b$,$ a$)=\{($q $,)\}($q$,$ b$,$ a$)=\{($q $,)\}($q$,,$ Z$0)=\{($f $,$ Z$0)\}($q$,$ b$,$ Z$0)=\{($q $,$ bZ$0)\}($q$,$ b$,$ b$)=\{($q $,$ bb$)\}($q$,$ a$,$ b$)=\{($f $,)\}($f$,$ a$,$ b$)=\{($f $,)\}$Show that the string "aabbba" is accepted by the given AB$.($s$,$ aabbba, Z$0)...$ continue.