Question 5
Which of the following statements correctly describes the relationship between Finite State Automata (FSA) and Finite State Transducers (FST)?
FSAs are designed solely for recognizing patterns in input strings, while FSTs can recognize patterns and produce corresponding outputs.
Both FSAs and FSTs utilize a single tape for processing input, but FSAs have a fixed number of states while FSTs can dynamically change the number of states during execution.
FSTs can be used to perform computations involving multiple input tapes, whereas FSAs are limited to a single input tape.
FSA can produce outputs based on their input states, while FSTs are only capable of recognizing inputs without generating outputs.