Wang automata are devices for picture language recognition recently introduced by us, which characterize the class REC of recognizable picture languages. Thus, Wang automata are equivalent to tiling systems or online tessellation acceptors, and are based like Wang systems on labeled Wang tiles. The present work focus on scanning strategies, to prove that the ones Wang automata are based on are those following four kinds of movements: boustrophedonic, “L-like”, “U-like”, and spirals.
Wang automata are devices for picture language
recognition recently introduced by us, which characterize the class
REC of recognizable picture languages. Thus, Wang automata are
equivalent to tiling systems or online tessellation acceptors, and
are based like Wang systems on labeled Wang tiles. The present work
focus on scanning strategies, to prove that the ones Wang automata
are based on are those following four kinds of movements:
boustrophedonic, “L-like”, “U-like”, and spirals.
PageRank is a ranking method that assigns scores to web pages using the limit
distribution of a random walk on the web graph. A of graphs is a
morphism that is a local isomorphism of in-neighbourhoods, much in the same way
a covering projection is a local isomorphism of neighbourhoods. We show that a
deep connection relates fibrations and , a
particular kind of Markov chains that include the PageRank one as a
special case. This fact provides constraints on the values that PageRank can
assume....
Download Results (CSV)