I'm developing a program that has some entities (things) that are classified according to relevancy. Sort of like search engine (think PageRank).Therefore, I'm looking to implement an automaton, which I think should handle value hierarchies. What I mean is that each next possible state should have a value that determines how relevant it is relative to the state from which are to be moved to it.Is this called a weighted automaton?Or a probabilistic automaton?This is what I want:(From: http://engineering.flipboard.com/2014/10/summarization/)To be able to have the states that can be moved to have different relevancy values.My application reminds of this:(notice the sub contexts centered at the blue texts)(From: http://shadow.cios.org:2222/www/vcceguide/images/full-screen/vcce-menunew-conceptanalysis-1c3b-tripleconceptnetwork-conceptmenusearch.png)I think it's an automaton that (in my program) would be going through those sub contexts (moving from blue text to blue text, based on user input). But what kind of automaton?
What is a weighted or probabilistic automaton?
automata;weighted graphs