Geometric representation of interval exchange maps over algebraic number fields

We consider the restriction of interval exchange transformations to algebraic number fields, which leads to maps on lattices. We characterize renormalizability arithmetically, and study its relationships with a geometrical quantity that we call the drift vector. We exhibit some examples of renormalizable interval exchange maps with zero and non-zero drift vector, and carry out some investigations of their properties. In particular, we look for evidence of the finite decomposition property: each lattice is the union of finitely many orbits.Comment: 34 pages, 8 postscript figure

Learning probability distributions generated by finite-state machines

We review methods for inference of probability distributions generated by probabilistic automata and related models for sequence generation. We focus on methods that can be proved to learn in the inference in the limit and PAC formal models. The methods we review are state merging and state splitting methods for probabilistic deterministic automata and the recently developed spectral method for nondeterministic probabilistic automata. In both cases, we derive them from a high-level algorithm described in terms of the Hankel matrix of the distribution to be learned, given as an oracle, and then describe how to adapt that algorithm to account for the error introduced by a finite sample.Peer ReviewedPostprint (author's final draft