A probabilistic approach to navigation in Hypertext

DOI10.1016/S0020-0255(98)10055-5zbMath0948.68109OpenAlexW2028750942MaRDI QIDQ1818980

George Loizou, Mark Levene

Publication date: 22 November 2000

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0255(98)10055-5

zbMATH Keywords

navigation problemHypertextHypertext databaseHypertext random automaton

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Formal languages and automata (68Q45) Computing methodologies for text processing; mathematical typography (68U15)

Related Items (1)

Improvement of algorithm on the track recognition

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A logic for reasoning about probabilities
• Reasoning with time and chance
• On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Regular Grammars and Finite Automata
• Finite Continuous Time Markov Chains
• Computational Complexity of Probabilistic Turing Machines
• Navigation in Hypertext Is Easy Only Sometimes
• Fuzzy events realized by finite probabilistic automata
• Probabilistic automata

This page was built for publication: A probabilistic approach to navigation in Hypertext