Regular languages under F-gsm mappings
Anthony J. Dos Reis · ACM SIGACT News · 1987
A generalized sequential machine with finalstates (f-gsm) is a Meal y machine extended in the following manner :-The output associated with each transition can be of any length .-An output is defined for an input only if the input takes the machine fro m the initial state to a final state .