Finite State Machines without output are often called Finite State Automata. They act as language recognizers/generators. The key concept is .

Group of answer choices

they build an abstract representation of the input syntax before translating the output

the translation of the grammar syntax into an intermediate representation of the computations to be performed

the addition of a set of final/accepting states that indicate language membership

the removal of output simplifies the abstract machine to make it easier to program