We analyze quasiasymptotic boundedness of distributions and their wavelet transforms, in general, as well as for a class of α− exponentially bounded distributions and their wavelet transforms in particular. The main idea of this paper is to use, instead of the quasiasymptotic behaviour, the notion of quasiasymptotic boundedness. In this way we obtain new Abelian type theorems for the wavelet tr...

We prove decidability of the boundedness problem for monadic least fixed-point recursion based on positive monadic second-order (MSO) formulae over trees. Given an MSO-formula φ(X,x) that is positive in X, it is decidable whether the fixed-point recursion based on φ is spurious over the class of all trees in the sense that there is some uniform finite bound for the number of iterations φ takes ...

Syntactic structure has been considered an integral component of agreement computation in language production. In agreement error studies, clause-boundedness (Bock & Cutting, 1992) and hierarchical feature-passing (Franck, Vigliocco, & Nicol, 2002) predict that local nouns within clausal modifiers should produce fewer errors than do those within phrasal modifiers due to structural differences; ...

The reachability analysis of weighted pushdown systems is a very powerful technique in verification and analysis of recursive programs. Each transition rule of a weighted pushdown system is associated with an element of a bounded semiring representing the weight of the rule. However, we have realized that the restriction of the boundedness is too strict and the formulation of weighted pushdown ...

We apply to Petri net theory the technique of polynomialtime many-one reductions. We study boundedness, reachability, deadlock, liveness problems and some of their variations. We derive three main results. Firstly, we highlight the power of expression of reachability which can polynomially give evidence of unboundedness. Secondly, we prove that reachability and deadlock are polynomially-time eq...

we investigate the long-term behavior of solutions of the difference equation[ x_{n+1}=x_{n}x_{n-3}-1 ,, n=0 ,, 1 ,, ldots ,, ]noindent where the initial conditions $x_{-3} ,, x_{-2} ,, x_{-1} ,, x_{0}$ are real numbers.  in particular, we look at the periodicity and asymptotic periodicity of solutions, as well as the existence of unbounded solutions.

Conditions for boundedness and compactness of product-convolution operators g —» PhCß = h ■ (/» g) on spaces L^G) are studied. It is necessary for boundedness to define a class of "mixed-norm" spaces L,p>q){G) interpolating the Lp(G) spaces in a natural way (L^^ = Z^,). It is then natural to study the operators acting between L(/1?)(G) spaces, where G has a compact invariant neighborhood. The t...

This paper proves the Lp-boundedness of general bilinear operators associated to a symbol or multiplier which need not be smooth. The Main Theorem establishes a general result for multipliers that are allowed to have singularities along the edges of a cone as well as possibly at its vertex. It thus unifies ealier results of Coifman-Meyer for smooth multipliers and ones, such the Bilinear Hilber...

DATALOG is the language of logic programs without function symbols. It is considered to be the paradigmatic database query language. If it is possible to eliminate recursion from a DATALOG program then it is bounded. Since bounded programs can be executed in the parallel constant time, the possibility of automatized boundedness detecting is believed to be an important issue, and has been studie...

Liouville-type theorems are powerful tools in partial differential equations. Boundedness assumption of solutions are often imposed in deriving such Liouville-type theorems. In this paper, we establish some Liouville-type theorems without the boundedness assumption of nonnegative solutions to certain classes of elliptic equations and systems. Using a rescaling technique and doubling lemma devel...