Evolving Turing Machine for Identifying the Broken/Bad Links on a Web-Site

摘要

In order to improve the efficiency of a web site, a web designer creates and breaks the links amongst the pages. If a page is requested which is not directly linked to the previous page or a broken link/ bad link is selected, multiple users are assumed to withdraw surfing on a web site. A web management tool is required to check the web site for broken/bad links amongst the pages. In this Paper, a model based on a Turing Machine has been presented to check a web site for broken links/ bad links amongst the pages. The validity of the links has been presented in terms of accepting or refecting a sequence of pages, selected by a user during the surfing. A function, called surf{sub}(TM) has also been depicted on Turing Machine. It has been shown that the acceptance or rejection of a sequence of pages can be defined by a function Surf{sub}(TM), which is computable on a Turing Machine.