Professional Documents
Culture Documents
Introduction To Finite Automata
Introduction To Finite Automata
Unfortunately not all languages and systems are simple like regular
languages or finite automata.
There are languages which are not regular and which, therefore, cannot be
recognized by finite automata.
We are going to learn languages which are not regular and ways to test
languages for non-regularity.
Later we are going to learn an extension of finite automata called Turing
machines.
Though Turing machines are simple modification of finite automata, they
are much more powerful computing devices than finite automata.
In fact Turing machines are as powerful as computers and it is generally
believed, though not proven, that any computation human beings do (with
or without computers) can be performed by Turing machines.