Relating automata to other fields (original) (raw)

Relating automata to other fields

Journal of Computing Sciences in Colleges, 2012

Abstract

ABSTRACT Automata classes including Turing Machines, Pushdown Automata and Finite Automata define the most elegant models of computation in terms of set processors. This study elaborates pedagogically motivated intuitive and formal relations between ...

Pradip Dey hasn't uploaded this paper.

Let Pradip know you want this paper to be uploaded.

Ask for this paper to be uploaded.