687 research outputs found

    Strategies to scan pictures with automata based on Wang tiles

    Get PDF
    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

    Deterministic recognizability of picture languages with Wang automata

    Get PDF
    special issue dedicated to the second edition of the conference AutoMathA: from Mathematics to ApplicationsInternational audienceWe present a model of automaton for picture language recognition, called Wang automaton, which is based on labeled Wang tiles. Wang automata combine features of both online tessellation acceptors and 4-way automata: as in online tessellation acceptors, computation assigns states to each picture position; as in 4-way automata, the input head visits the picture moving from one pixel to an adjacent one, according to some scanning strategy. Wang automata recognize the class REC, i.e. they are equivalent to tiling systems or online tessellation acceptors, and hence strictly more powerful than 4-way automata. We also introduce a natural notion of determinism for Wang automata, and study the resulting class, extending the more traditional approach of diagonal-based determinism, used e. g. by deterministic tiling systems. In particular, we prove that the concept of row (or column) ambiguity defines the class of languages recognized by Wang automata directed by boustrophedonic scanning strategies

    Pattern statistics and Vandermonde matrices

    Get PDF
    In this paper we determine some limit distributions of pattern statistics in rational stochastic models. We present a general approach to analyze these statistics in rational models having an arbitrary number of strongly connected components. We explicitly establish the limit distributions in most significant cases; they are characterized by a family of unimodal density functions defined by means of confluent Vandermonde matrices

    Frequency of symbol occurrences in simple non-primitive stochastic models

    Get PDF
    We study the random variable Y-n representing the number of occurrences of a given symbol in a word of length n generated at random. The stochastic model we assume is a simple non-ergodic model defined by the product of two primitive rational formal series, which form two distinct ergodic components. We obtain asymptotic evaluations for the mean and the variance of Y-n and its limit distribution. It turns out that there are two main cases: if one component is dominant and non-degenerate we get a Gaussian limit distribution; if the two components are equipotent and have different leading terms of the mean, we get a uniform limit distribution. Other particular limit distributions are obtained in the case of a degenerate dominant component and in the equipotent case when the leading terms of the expectation values are equal

    Frequency of symbol occurrences in bicomponent stochastic models

    Get PDF
    We give asymptotic estimates of the frequency of occurrences of a symbol in a random word Generated by any bicomponent stochastic model. More precisely, we consider the random variable Y-n representing the number of occurrences of a given symbol in a word of length n generated at random; the stochastic model is defined by a rational formal series r having a linear representation with two primitive components. This model includes the case when r is the product or the sum of two primitive rational formal series. We obtain asymptotic evaluations for the mean value and the variance of Yn and its limit distribution

    The Number of Convex Permutominoes

    Get PDF
    Permutominoes are polyominoes defined by suitable pairs of permutations. In this paper we provide a formula to count the number of convex permutominoes of given perimeter. To this aim we define the transform of a generic pair of permutations, we characterize the transform of any pair defining a convex permutomino, and we solve the counting problem in the transformed space

    Effect of stand-replacing fires on Mediterranean plant species in their marginal alpine range

    Get PDF
    In the southern side of the Alps, many relic species with Mediterranean and sub-Mediterranean distribution were described in mild-winter, fire-prone areas. Very few studies have modeled the importance of environmental factors on their distribution. In this paper, we assessed the effect of fire on the occurrence of euri- and steno-Mediterranean (ESM) species in Pinus sylvestris forests of Aosta Valley (Italy), by analyzing vegetation in a chronosequence of six stand-replacing fires (1962-2006). We analyzed species richness along the chronosequence, and modeled it as a function of time since fire, environment, and stand structure. We observed a strong positive association between ESM and total species richness. Temporal vegetation dynamics did not follow the direct succession pattern that is commonly observed in Mediterranean ecosystems. Two distinct maxima of ESM species richness were observed: (1) short lived, ruderal species (32 % of all ESM species) in the early post-fire stages, and (2) dry grassland species (54 %) in intermediate stages. The first were facilitated by the consumption of canopy and litter during fire, while the second by delayed tree canopy closure. In multivariate models of ESM species richness, light and elevation were the only significant predictors. Contrary to expectations, time since fire was not significant. Our study suggests that stand-replacing fires play an important role in preserving Mediterranean species in the study area by maintaining an open canopy, and promote local species diversity
    • …
    corecore