The Navigational Power of Web Browsers

We investigate the computational capabilities of Web browsers, when equipped with a standard finite automaton. We observe that Web browsers are Turingcomplete. We introduce the notion of a navigational problem, and investigate the complexity of solving Web queries and navigational problems by Web browsers, where complexity is measured by the number of clicks.Software TechnologyElectrical Engineering, Mathematics and Computer Scienc