Back to Search Start Over

The Navigational Power of Web Browsers.

Authors :
Bielecki, Michał
Hidders, Jan
Paredaens, Jan
Spielmann, Marc
Tyszkiewicz, Jerzy
Bussche, Jan
Source :
Theory of Computing Systems. Feb2012, Vol. 50 Issue 2, p213-240. 28p.
Publication Year :
2012

Abstract

We investigate the computational capabilities of Web browsers, when equipped with a standard finite automaton. We observe that Web browsers are Turing-complete. 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. [ABSTRACT FROM AUTHOR]

Subjects

Subjects :
*WEB browsers
*COMPUTATIONAL complexity
*SEQUENTIAL machine theory
*TURING (Computer program language)
*COMPUTATIONAL mathematics
*COMPLETENESS theorem
*QUERYING (Computer science)

Details

Language :
English
ISSN :
14324350
Volume :
50
Issue :
2
Database :
Academic Search Index
Journal :
Theory of Computing Systems
Publication Type :
Academic Journal
Accession number :
70205989
Full Text :
https://doi.org/10.1007/s00224-010-9294-3
Full Text Access
View/download PDF

Tools

Authors Abstract Subjects Details