On the expressiveness of links in hypertext systems
On the expressiveness of links in hypertext systems
In this paper, we study how linking mechanisms contribute to the expressiveness of hypertext systems. For this purpose, we formalise hypertext systems as abstract machines. As the primary benefit of hypertext systems is to be able to read documents non-linearly, their expressiveness is defined in terms of the ability to follow links. Then, we classify hypertext systems according to the power of the underlying automaton. The model allow us to compare embedded vs separate links and simple vs generic links. Then, we investigate history mechanisms, adaptive hypertexts, and functional links. Our conclusion is that simple links, whether embeded or separate, generic links, and some adaptive links all give hypertext systems the power of finite state automata. The history mechanism confers them the power of pushdown automata, whereas the general functional links give them Turing completeness.
459-473
Moreau, Luc
033c63dd-3fe9-4040-849f-dfccbe0406f8
Hall, Wendy
11f7f8db-854c-4481-b1ae-721a51d8790c
1998
Moreau, Luc
033c63dd-3fe9-4040-849f-dfccbe0406f8
Hall, Wendy
11f7f8db-854c-4481-b1ae-721a51d8790c
Moreau, Luc and Hall, Wendy
(1998)
On the expressiveness of links in hypertext systems.
The Computer Journal, 41 (7), .
(doi:10.1093/comjnl/41.7.459).
Abstract
In this paper, we study how linking mechanisms contribute to the expressiveness of hypertext systems. For this purpose, we formalise hypertext systems as abstract machines. As the primary benefit of hypertext systems is to be able to read documents non-linearly, their expressiveness is defined in terms of the ability to follow links. Then, we classify hypertext systems according to the power of the underlying automaton. The model allow us to compare embedded vs separate links and simple vs generic links. Then, we investigate history mechanisms, adaptive hypertexts, and functional links. Our conclusion is that simple links, whether embeded or separate, generic links, and some adaptive links all give hypertext systems the power of finite state automata. The history mechanism confers them the power of pushdown automata, whereas the general functional links give them Turing completeness.
Text
lnk
- Accepted Manuscript
More information
Published date: 1998
Organisations:
Web & Internet Science
Identifiers
Local EPrints ID: 252753
URI: http://eprints.soton.ac.uk/id/eprint/252753
PURE UUID: 23a738c5-8925-467a-bd94-bf3228a59666
Catalogue record
Date deposited: 20 Mar 2000
Last modified: 15 Mar 2024 02:33
Export record
Altmetrics
Contributors
Author:
Luc Moreau
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics