It is quite possible for the machine to accept an infinite number of strings and reject an even greater number of strings. For example, it would be very easy to design a function which accepts all strings whose length is an even multiple of three. This is a very easy function to write. Return zero to denote failure. Return one to denote success.
Machines are inherently recognizers.
The machine itself is the embodiment of a pattern. It recognizes any input string which matches the built-in pattern. Therefore, a codification of these automatons is the basic job of the programmer who wants tomatch some patterns. There are many different classes of machines and the languages they recognize. Each successive machine in this list provides a superset of the capabilities of the machines appearing before it.