FA With Output | Finite Automata With Output | Mealy Machine in TOC
FA With Output | Finite Automata With Output | Mealy Machine in TOC
our whatsapp link https://chat.whatsapp.com/CpIdn3GevjO...
play list link https://www.youtube.com/results?searc...
#TheoryOfAutomat
#FAwithOutput
#MooreMachine
#MealyMachine
TOC: Finite Automata With Outputs
Topics discussed:
1. Finite Automata With Outputs
2. Mealy Machine
3. Moore Machine
4. Difference between Mealy Machine & Moore Machine
Finite Automaton with output
Finite automaton discussed so far, is just associated with the RE or the language.
There is a question whether does there exist an FA which generates an output string corresponding to each input
string ? The answer is yes. Such machines are called machines with output.
There are two types of machines with output. Moore machine and Mealy machine
Moore machine
A Moore machine consists of the following
A finite set of states q0, q1, q2, … where q0 is the initial state.
An alphabet of letters Σ = {a,b,c,…} from which the input strings are formed.
An alphabet Γ={x,y,z,…} of output characters from which output strings are generated.
A transition table that shows for each state and each input letter what state is entered the next.
An output table that shows what character is printed by each state as it is entered.
Note
It is to be noted that since in Moore machine no state is designated to be a final state, so there is no question of
accepting any language by Moore machine. However in some cases the relation between an input string and the
corresponding output string may be identified by the Moore machine. Moreover, the state to be initial is not
important as if the machine is used several times and is restarted after some time, the machine will be started
from the state where it was left off.