The theories of formal languages, automata, Turing Machines and computation are essentially a result of theoretical computer science for educational purpose, yet have a wide range of applications in compiling techniques, robotics, artificial intelligence etc. In the quest of exploring the possibility of embedding the theoretical concept of Turing Machine for modeling the various features of web technology, this paper is presented. In this Paper, we outline a theoretical framework for computational study of Turing Machine on vocabulary {0, 1} for identifying the broken/bad links amongst the pages.
展开▼
