practically implemented is only DETERMINISTIC FINITE AUTOMETA..
so when we gave string as input...there will be a controller...now we see the input...and go to the transaction on that symbol...say on A we go to state2....like that we have only one way to go in front because its DET. AUTOMETA....after completion of string we have doller...when controller see the doller and if we are in final state ...string accepted...if not means we are landed up in nonfinal state which state that string doesnt belong to language...
