view full playlist:
TOC-Module1: • Theory Of Computation-Module1
TOC-Module2: • Theory Of Computation-Module2.1(Finite Aut...
#automata
#whatisautomata
#toclectures
#theoryofcomputation
#classesofautomata
We have seen what is language and grammar.Now we will see what an automata does as an acceptor or recogniser for a language.
Since automata is a state machine,we will see how to represent it using a state transition diagram,what is an initial state and final state,how a string is accepted or rejected with the state transitions.
We also discuss the general classification of automata,finite automata,pushdown automata,linear bounded automata and a turning machine.