Browser machines are finite automata with a back-forward stack, and
serve to formalize automated navigation with a Web browser. We
investigate the power of browser machines in computing Web queries and
in solving navigational problems. We also discuss the "click
complexity" of browser machines. Finally, we show that allowing
browser machines to reverse their back-forward stack considerably
enhances their power.
Joint work with Michal Bielecki, Jan Hidders, Jan Paredaens, Marc
Spielmann and Jerzy Tyszkiewicz
Papers reporting on this work were presented at PODS 2002 and ICALP
2002.
|