Deque Automata for Formal Languages

The purpose of computation involves solving problems by communicating them to a computational model by means of a suitable language. A number of languages have been developed for this purpose. To recognize these languages some computational models has been developed and they are finite state machine, push down automata, queue automata and turing machines. But these machines are restricted to specific formal languages like regular, context free, etc. In this paper we proposed a machine called a Dequeue automaton that is capable of recognizing different classes of automata. The Data analysis of simulation results from the Deque automata.