The template definitions of the following tokens are given using regular expressions.

In addition, it is a given that the alphabet also includes the symbols c and d $($in addition to a and b$).$

Token$1$: a $($a $|$ b a

Token$2$: $($aba

A$.$ Build a deterministic finite state automaton $($with the possibility of "getting stuck"$)$ with a limited commonality

Most for identifying the $1$Token and $2-$Token tokens.

Indicate next to each receiving state of the automaton which token will be returned in that state.

List all the stages of the calculation. $)$ joint non$-$deterministic automaton, finite automaton

Considerable deterministic, limited automaton with the possibility of getting stuck.