Language-theoretic classification of hypermedia paths

Authors:
David Stotts;Richard Furuta
Affiliations:
Univ. of North Carolina at Chapel Hill;Texas A&M University, College Station, TX
Venue:
Proceedings of the fifteenth ACM conference on Hypertext and hypermedia
Year:
2004

Citing 5
Cited 1

Petri-net-based hypertext: document structure with browsing semantics

ACM Transactions on Information Systems (TOIS)
Scripted documents: a hypermedia path mechanism

HYPERTEXT '89 Proceedings of the second annual ACM conference on Hypertext
Hypertext paths and the World-Wide Web: experiences with Walden's Paths

HYPERTEXT '97 Proceedings of the eighth ACM conference on Hypertext
Hyperdocuments as automata: verification of trace-based browsing properties by model checking

ACM Transactions on Information Systems (TOIS)
Browsing intricately interconnected paths

Proceedings of the fourteenth ACM conference on Hypertext and hypermedia

Separation of concerns in hypertext: articulation points that increase flexibility

From Integrated Publication and Information Systems to Virtual Information and Knowledge Environments

Quantified Score

Hi-index	0.00

Visualization

Abstract

Paths are, and have been since the beginning, an important mechanism for organizing hypermedia documents. This note shows how a document defined as a (possibly infinite) collection of paths over content nodes can be succinctly expressed as a formal language. We show the relationship to earlier hypermedia models based on automata. The language-theoretic model can be used to implement path engines as parsers or recognizers. Different levels of path power require different classes of recognizing automata.