ITA
2006
13 years 10 months ago
2006
We consider the four families of recognizable, synchronous, deterministic rational and rational subsets of a direct product of free monoids. They form a strict hierarchy and we in...
ITA
2006
13 years 10 months ago
2006
PageRank is a ranking method that assigns scores to web pages using the limit distribution of a random walk on the web graph. A fibration of graphs is a morphism that is a local i...
ITA
2006
13 years 10 months ago
2006
ITA
2006
13 years 10 months ago
2006
In this work we study some probabilistic models for the random generation of words over a given alphabet used in the literature in connection with pattern statistics. Our goal is t...
ITA
2008
13 years 10 months ago
2008
A set T L is a Parikh test set of L iff c(T ) is a test set of c(L). We give an effective characterization of Parikh test sets for arbitrary commutative language.
ITA
2008
13 years 10 months ago
2008
ITA
2008
13 years 10 months ago
2008
The complexity of infinite words is considered from the point of view of a transformation with a Mealy machine that is the simplest model of a finite automaton transducer. We are ...
ITA
2008
13 years 10 months ago
2008
The necessary and sufficient conditions are extracted for periodicity of bi-ideals. By the way two proper subclasses of uniformly recurrent words are introduced.
ITA
2008
13 years 10 months ago
2008
A language L A is literally idempotent in case that ua2 v L if and only if uav L, for each u, v A , a A. Varieties of literally idempotent languages result naturally by taking...