For a Turing machine, the language outputted by it is exactly a r.e. language. Any r.e. language can be the outputted language of some TM.
For a finite automaton with outputs (e.g. Mealy and Moore machines), does the language outputted by it belong to some type of languages in Chomsky hierarchy or its refinement? Does the family of languages outputted by finite automata with outputs exactly form some type of languages in Chomsky hierarchy or its refinement?
Is it correct that all the strings in language G(M) are generated by a TM M, as strings between a pair of #'s, when the input string to M is the empty string? Similarly, how is the language generated/outputted by a Moore or Mealy machine defined?
What are considered as strings in the language?
what is the input string to a FA, when talking about the language outputted by the FA? Do the languages outputted by a FA vary for different input strings?
Thanks.
These are the regular languages, more often now called rational languages.