Intro to Finite Automata|Theory Of Computation
We have seen there are different classes of automata.Finite automata is the simplest form of automata which accepts the simplest class of languages called regular languages.In this video,we will discuss what is meant by a finite automata and how it is different from other classes of automata.We will also see the different types of finite automata in general.
view full playlist:
TOC-Module1: • Theory Of Computation-Module1
TOC-Module2: • Theory Of Computation-Module2.1(Finite Aut...
#automatatheory
#toc
#theoryofcomputation
#finiteautomata
#dfa
#nfa