Types of Automata Machines

Types of Finite State Machine:

Acceptors:

·      Also called recognizer and sequence detectors, which produce binary output, indicating whether or not the received input is accepted.

·      Each state of an acceptor is either "Accepting state “or "Rejecting state".

·      The languages which are accepted by acceptor are called regular languages.

·     Once all input has been received by machine, if the current state is an accepting state, it means that the input is accepted; otherwise it is rejected.

Transducers:

·      Transducers generate output based on a given input and/or a state using actions.

·      In these machines output is associated with input. 

Generators:

·      For particular language, if we want to generate all the strings, then generators are used.

·      Also called sequencers