Title
|
|
|
|
The navigational power of web browsers
|
|
Author
|
|
|
|
|
|
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. |
|
|
Language
|
|
|
|
English
|
|
Source (journal)
|
|
|
|
Theory of computing systems. - New York, N.Y.
|
|
Publication
|
|
|
|
New York, N.Y.
:
2012
|
|
ISSN
|
|
|
|
1432-4350
|
|
DOI
|
|
|
|
10.1007/S00224-010-9294-3
|
|
Volume/pages
|
|
|
|
50
:2
(2012)
, p. 213-240
|
|
ISI
|
|
|
|
000299090700001
|
|
Full text (Publisher's DOI)
|
|
|
|
|
|
Full text (publisher's version - intranet only)
|
|
|
|
|
|