7,206 research outputs found
Survey : Weighted extended top-down tree transducers part I. : basics and expressive power
Weighted extended top-down tree transducers (transducteurs généralisés descendants [Arnold, Dauchet: Bi-transductions de forêts. ICALP'76. Edinburgh University Press, 1976]) received renewed interest in the field of Natural Language Processing, where they are used in syntax-based machine translation. This survey presents the foundations for a theoretical analysis of weighted extended top-down tree transducers. In particular, it discusses essentially complete semirings, which are a novel concept that can be used to lift incomparability results from the unweighted case to the weighted case even in the presence of infinite sums. In addition, several equivalent ways to define weighted extended top-down tree transducers are presented and the individual benefits of each presentation is shown on a small result
Variance and Covariance of Several Simultaneous Outputs of a Markov Chain
The partial sum of the states of a Markov chain or more generally a Markov
source is asymptotically normally distributed under suitable conditions. One of
these conditions is that the variance is unbounded. A simple combinatorial
characterization of Markov sources which satisfy this condition is given in
terms of cycles of the underlying graph of the Markov chain. Also Markov
sources with higher dimensional alphabets are considered.
Furthermore, the case of an unbounded covariance between two coordinates of
the Markov source is combinatorically characterized. If the covariance is
bounded, then the two coordinates are asymptotically independent.
The results are illustrated by several examples, like the number of specific
blocks in --sequences and the Hamming weight of the width-
non-adjacent form
Weak MSO+U with Path Quantifiers over Infinite Trees
This paper shows that over infinite trees, satisfiability is decidable for
weak monadic second-order logic extended by the unbounding quantifier U and
quantification over infinite paths. The proof is by reduction to emptiness for
a certain automaton model, while emptiness for the automaton model is decided
using profinite trees.Comment: version of an ICALP 2014 paper with appendice
- …