Results 1  10
of
150
Properties of the Extremal Innite Smooth Words
, 2005
"... Smooth words are connected to the Kolakoski sequence. We construct the maximal and the minimal in nite smooth words, with respect to the lexicographical order. The naive algorithm generating them is improved by using a reduction of the De Bruijn graph of their factors. We also study their Lyndon fac ..."
Abstract
 Add to MetaCart
Smooth words are connected to the Kolakoski sequence. We construct the maximal and the minimal in nite smooth words, with respect to the lexicographical order. The naive algorithm generating them is improved by using a reduction of the De Bruijn graph of their factors. We also study their Lyndon
The SizeChange Principle for Program Termination
, 2001
"... The \sizechange termination" principle for a rstorder functional language with wellfounded data is: a program terminates on all inputs if every innite call sequence (following program control ow) would cause an innite descent in some data values. Sizechange analysis is based only on local ..."
Abstract

Cited by 203 (14 self)
 Add to MetaCart
The \sizechange termination" principle for a rstorder functional language with wellfounded data is: a program terminates on all inputs if every innite call sequence (following program control ow) would cause an innite descent in some data values. Sizechange analysis is based only
Generalization Bound for Innitely Divisible Empirical Process
"... In this paper, we study the generalization bound for an empirical process of samples independently drawn from an infinitely divisible (ID) distribution, which is termed as the ID empirical process. In particular, based on a martingale method, we develop deviation inequalities for the sequence of ..."
Abstract
 Add to MetaCart
In this paper, we study the generalization bound for an empirical process of samples independently drawn from an infinitely divisible (ID) distribution, which is termed as the ID empirical process. In particular, based on a martingale method, we develop deviation inequalities for the sequence
On Kakutani's Dichotomy Theorem for Innite Products of not Necessarily Independent Functions
"... (1.1) Background. The background for the present communication is Kakutani's famous dichotomy theorem [10], viz.: if ( n; F n) is a sequence of measurable spaces and Pn and Qn are probability measures ..."
Abstract
 Add to MetaCart
(1.1) Background. The background for the present communication is Kakutani's famous dichotomy theorem [10], viz.: if ( n; F n) is a sequence of measurable spaces and Pn and Qn are probability measures
Scalar Wave Diraction by a Perfectly Soft Innitely Thin Circular Ring
"... A new strong mathematically rigorous and numerically eective method for solving the boundary value problem of scalar (for example acoustic) wave diraction by a perfectly soft (Dirichlet boundary condition) in nitely thin circular ring is proposed. The method is based on the combination of the Orthog ..."
Abstract
 Add to MetaCart
of the Orthogonal Polynomials Approach, and on the ideas of the methods of analytical regularization. As a result of the suggested regularization procedure, the initial boundary value problem is equivalently reduced to the innite system of the linear algebraic equations of the second kind, i.e., to an equation
Global complexities for in nite sequences MiraCristiana Anisiu T. PopoviciuInstitute of Numerical Analysis
"... The language complexity of a
nite word or in
nite sequence is aimed to give a measure of the number of di¤erent factors in the given word or sequence. In fact, the de
nitions in the
nite or in
nite case coincide. Let A be a
nite nonvoid alphabet and U = u0u1::: an in
nite sequence ..."
Abstract
 Add to MetaCart
The language complexity of a
nite word or in
nite sequence is aimed to give a measure of the number of di¤erent factors in the given word or sequence. In fact, the de
nitions in the
nite or in
nite case coincide. Let A be a
nite nonvoid alphabet and U = u0u1::: an in
nite sequence
Approximate pvalues for local sequence alignments
 Ann. Statist
, 2000
"... Siegmund and Yakir (2000) have given an approximate pvalue when two independent, identically distributed sequences from a nite alphabet are optimally aligned based on a scoring system that rewards similarities according to a general scoring matrix and penalizes gaps (insertions and deletions). The ..."
Abstract

Cited by 39 (1 self)
 Add to MetaCart
). The approximation involves an innite sequence of difculttocompute parameters. In this paper, it is shown by numerical studies that these reduce to essentially two numerically distinct parameters, which can be computed as onedimensional numerical integrals. For an arbitrary scoring matrix and afne gap penalty
Symmetries of Toda equations
 J. Phys. A
, 1993
"... We nd a sequence consisting of time dependent evolution vector elds whose time independent part corresponds to the master symmetries for the Toda equations. Each master symmetry decomposes as a sum consisting of a group symmetry and a Hamiltonian vector eld. Taking Lie derivatives in the direction ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
of these vector elds produces an innite sequence of recursion operators.
Spatial Representation of Symbolic Sequences through Iterative Function Systems
"... Jerey [10] proposed a graphic representation of DNA sequences using Barnsley's iterative function systems. In spite of further developments in this direction [19, 25, 13], the proposed graphic representation of DNA sequences has been lacking a rigorous connection between its spatial scaling ch ..."
Abstract
 Add to MetaCart
characteristics and the statistical characteristics of the DNA sequences themselves. We 1) generalize Jerey's graphic representation to accommodate (possibly innite) sequences over an arbitrary nite number of symbols, 2) establish a direct correspondence between the statistical characterization of symbolic
www.elsevier.com/locate/spa Individual behaviors of oriented walks
, 2000
"... Given an innite sequence t = (k)k of −1 and +1, we consider the oriented walk dened by Sn(t) = Pn k=1 12: : : k. The set of t’s whose behaviors satisfy Sn(t) bn is considered (b 2 R and 0<61 being xed) and its Hausdor dimension is calculated. A twodimensional model is also studied. A threed ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Given an innite sequence t = (k)k of −1 and +1, we consider the oriented walk dened by Sn(t) = Pn k=1 12: : : k. The set of t’s whose behaviors satisfy Sn(t) bn is considered (b 2 R and 0<61 being xed) and its Hausdor dimension is calculated. A twodimensional model is also studied. A three
Results 1  10
of
150