{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,2]],"date-time":"2024-01-02T14:46:18Z","timestamp":1704206778739},"reference-count":28,"publisher":"Elsevier BV","issue":"1-4","license":[{"start":{"date-parts":[[1999,3,1]],"date-time":"1999-03-01T00:00:00Z","timestamp":920246400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Sciences"],"published-print":{"date-parts":[[1999,3]]},"DOI":"10.1016\/s0020-0255(98)10055-5","type":"journal-article","created":{"date-parts":[[2003,4,24]],"date-time":"2003-04-24T21:23:41Z","timestamp":1051219421000},"page":"165-186","source":"Crossref","is-referenced-by-count":24,"title":["A probabilistic approach to navigation in Hypertext"],"prefix":"10.1016","volume":"114","author":[{"given":"Mark","family":"Levene","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"George","family":"Loizou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0255(98)10055-5_bib1","series-title":"Distance in Graphs","author":"Buckley","year":"1990"},{"key":"10.1016\/S0020-0255(98)10055-5_bib2","first-page":"101","article-title":"As we may think","volume":"76","author":"Bush","year":"1945","journal-title":"Atlantic Monthly"},{"key":"10.1016\/S0020-0255(98)10055-5_bib3","series-title":"Introduction to Lattices and Order","author":"Davey","year":"1990"},{"key":"10.1016\/S0020-0255(98)10055-5_bib4","first-page":"997","article-title":"Temporal and modal logic","volume":"vol. B","author":"Emerson","year":"1990"},{"key":"10.1016\/S0020-0255(98)10055-5_bib5","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1016\/0890-5401(90)90060-U","article-title":"A logic for reasoning about probabilities","volume":"87","author":"Fagin","year":"1990","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0020-0255(98)10055-5_bib6","series-title":"An Introduction to Probability Theory and its Applications","author":"Feller","year":"1968"},{"key":"10.1016\/S0020-0255(98)10055-5_bib7","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1002\/(SICI)1097-4571(199203)43:2<183::AID-ASI11>3.0.CO;2-S","article-title":"Models for Hypertext","volume":"43","author":"Frisse","year":"1992","journal-title":"J. Am. Soc. Inform. Sci."},{"key":"10.1016\/S0020-0255(98)10055-5_bib8","series-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0020-0255(98)10055-5_bib9","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1137\/0206049","article-title":"Computational complexity of probabilistic Turing machines","volume":"6","author":"Gill","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0020-0255(98)10055-5_bib10","series-title":"Discrete and Combinatorial Mathematics","author":"Grimaldi","year":"1989"},{"key":"10.1016\/S0020-0255(98)10055-5_bib11","series-title":"Introduction to Automata Theory, Languages and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/S0020-0255(98)10055-5_bib12","first-page":"67","article-title":"A catalog of complexity classes","volume":"vol. A","author":"Johnson","year":"1990"},{"key":"10.1016\/S0020-0255(98)10055-5_bib13","series-title":"Finite Markov Chains","author":"Kemeny","year":"1960"},{"key":"10.1016\/S0020-0255(98)10055-5_bib14","series-title":"Automata Studies","first-page":"183","article-title":"Computability by probabilistic Turing machines","author":"de Leeuw","year":"1956"},{"key":"10.1016\/S0020-0255(98)10055-5_bib15","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/S0019-9958(82)91022-1","article-title":"Reasoning with time and chance","volume":"53","author":"Lehman","year":"1982","journal-title":"Inform. and Control"},{"key":"10.1016\/S0020-0255(98)10055-5_bib16","unstructured":"M. Levene, G. Loizou, Navigation in Hypertext is easy only sometimes, Research Note RN\/94\/43, Department of Computer Science, University College London."},{"key":"10.1016\/S0020-0255(98)10055-5_bib17","series-title":"Counter-Free Automata","author":"McNaughton","year":"1971"},{"key":"10.1016\/S0020-0255(98)10055-5_bib18","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1016\/S0019-9958(68)90353-7","article-title":"Fuzzy events realized by finite probabilistic automata","volume":"12","author":"Nasu","year":"1968","journal-title":"Inform. and Control"},{"key":"10.1016\/S0020-0255(98)10055-5_bib19","series-title":"Hypertext and Hypermedia","author":"Nielsen","year":"1990"},{"key":"10.1016\/S0020-0255(98)10055-5_bib20","series-title":"Introduction to Probabilistic Automata","author":"Paz","year":"1971"},{"key":"10.1016\/S0020-0255(98)10055-5_bib21","first-page":"1","article-title":"Finite automata","volume":"vol. B","author":"Perrin","year":"1990"},{"key":"10.1016\/S0020-0255(98)10055-5_bib22","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1016\/S0019-9958(63)90290-0","article-title":"Probabilistic automata","volume":"6","author":"Rabin","year":"1963","journal-title":"Inform. and Control"},{"key":"10.1016\/S0020-0255(98)10055-5_bib23","series-title":"Algorithms and Complexity, Recent Results and New Directions","first-page":"21","article-title":"Probabilistic algorithms","author":"Rabin","year":"1976"},{"key":"10.1016\/S0020-0255(98)10055-5_bib24","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1145\/175235.175242","article-title":"Navigating in hyperspace: Designing a structure-based toolbox","volume":"37","author":"Rivlin","year":"1994","journal-title":"Commun. ACM"},{"key":"10.1016\/S0020-0255(98)10055-5_bib25","doi-asserted-by":"crossref","first-page":"598","DOI":"10.1137\/0214044","article-title":"On the equivalence and containment problems for unambiguous regular expressions, regular grammars and finite automata","volume":"14","author":"Stearns","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0020-0255(98)10055-5_bib26","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1145\/64789.64791","article-title":"Petri-net-based Hypertext: Document structure with browsing semantics","volume":"7","author":"Stotts","year":"1989","journal-title":"ACM Trans. Inform. Systems"},{"key":"10.1016\/S0020-0255(98)10055-5_bib27","series-title":"Proceedings of the ACM Conference on Hypertext, ECHT'92","first-page":"272","article-title":"Hyperdocuments as automata: Trace-based browsing property verification","author":"Stotts","year":"1992"},{"key":"10.1016\/S0020-0255(98)10055-5_bib28","volume":"vol. I","author":"Ullman","year":"1988"}],"container-title":["Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025598100555?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025598100555?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T10:54:03Z","timestamp":1556362443000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020025598100555"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,3]]},"references-count":28,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[1999,3]]}},"alternative-id":["S0020025598100555"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0255(98)10055-5","relation":{},"ISSN":["0020-0255"],"issn-type":[{"value":"0020-0255","type":"print"}],"subject":[],"published":{"date-parts":[[1999,3]]}}}