A probabilistic approach to navigation in Hypertext
From MaRDI portal
(Redirected from Publication:1818980)
Recommendations
Cites work
- A logic for reasoning about probabilities
- Computational Complexity of Probabilistic Turing Machines
- Finite Continuous Time Markov Chains
- Fuzzy events realized by finite probabilistic automata
- scientific article; zbMATH DE number 42741 (Why is no real title available?)
- scientific article; zbMATH DE number 3597592 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1142309 (Why is no real title available?)
- scientific article; zbMATH DE number 1142311 (Why is no real title available?)
- scientific article; zbMATH DE number 1142326 (Why is no real title available?)
- scientific article; zbMATH DE number 194437 (Why is no real title available?)
- scientific article; zbMATH DE number 194916 (Why is no real title available?)
- scientific article; zbMATH DE number 3249395 (Why is no real title available?)
- scientific article; zbMATH DE number 3311755 (Why is no real title available?)
- scientific article; zbMATH DE number 3368555 (Why is no real title available?)
- scientific article; zbMATH DE number 3371972 (Why is no real title available?)
- Navigation in Hypertext Is Easy Only Sometimes
- On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Regular Grammars and Finite Automata
- Probabilistic automata
- Reasoning with time and chance
Cited in
(3)
This page was built for publication: A probabilistic approach to navigation in Hypertext
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1818980)