Navigating with a Browser

Authors:
Michal Bielecki;Jan Hidders;Jan Paredaens;Jerzy Tyszkiewicz;Jan Van den Bussche
Affiliations:
-;-;-;-;-
Venue:
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Year:
2002

Citing 5
Cited 4

Finite-memory automata

Theoretical Computer Science
Communication complexity

Communication complexity
Queries and computation on the Web

Theoretical Computer Science - Special issue on the 6th International Conference on Database Theory—ICDT '97
Distributed computation of web queries using automata

Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Foundations of Databases: The Logical Level

Foundations of Databases: The Logical Level

An algebraic characterization of deterministic regular languages over infinite alphabets

Theoretical Computer Science
Regular Expressions for Languages over Infinite Alphabets

Fundamenta Informaticae
A succinct canonical register automaton model

ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
Regular Expressions for Languages over Infinite Alphabets

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the navigation power of Web browsers, such as Netscape Navigator, Internet Explorer or Opera. To this end, we formally introduce the notion of a navigational problem. We investigate various characteristics of such problems which make them hard to visit with small number of clicks.