We investigate ambiguity for symmetric difference nondeterministic finite automata. We show the existence of unambiguous, finitely ambiguous, polynomially ambiguous and exponentially ambiguous symmetric difference nondeterministic finite automata. We show that, for each of these classes, there is a family of n-state nondeterministic finite automata such that the smallest equivalent deterministi...

The symmetric Al-Salam–Chihara polynomials for q > 1 are associated with an indeterminate moment problem. There is a self-adjoint second order difference operator on l(Z) to which these polynomials are eigenfunctions. We determine the spectral decomposition of this self-adjoint operator. This leads to a class of discrete orthogonality measures, which have been obtained previously by Christianse...

Previously, self-verifying symmetric difference automata were defined and a tight bound of 2n−1−1 was shown for state complexity in the unary case. We now consider the non-unary case and show that, for every n≥ 2, there is a regular languageLn accepted by a non-unary self-verifying symmetric difference nondeterministic automaton with n states, such that its equivalent minimal deterministic fini...

We mainly investigate the global asymptotic stability and exponential convergence of positive solutions to two families of higher-order difference equations, one of which was recently studied in Stević’s paper 2010 . A new concise proof is given to a quite recent result by Stević and analogous parallel result of the other inverse equation, which extend related results of Aloqeili 2009 , Berenha...

We show that the complexity (the number of elements) of an optimal parabolic or conic spline approximating a smooth curve with nonvanishing curvature to within symmetric difference distance ε is c1 ε −1/4 + O(1), if the spline consists of parabolic arcs and c2 ε −1/5 +O(1), if it is composed of general conic arcs of varying type. The constants c1 and c2 are expressed in the affine curvature of ...

This paper introduces a new difference scheme to the difference equations for N-body type problems. To find the non-collision periodic solutions and generalized periodic solutions in multi-radial symmetric constraint for the N-body type difference equations, the variational approach and the method of minimizing the Lagrangian action are adopted and the strong force condition is considered corre...

In a recent paper, Pawale [22] investigated quasi-symmetric 2-(v, k, λ) designs with intersection numbers x > 0 and y = x+ 2 with λ > 1 and showed that under these conditions either λ = x + 1 or λ = x + 2, or D is a design with parameters given in the form of an explicit table, or the complement of one of these designs. In this paper, quasi-symmetric designs with y−x = 3 are investigated. It is...

In this paper, we are starting a systematic analysis of a class of symmetric polynomials which, in full generality,was introduced in [Sa]. The main features of these functions are that they are defined by vanishing conditions and that they are nonhomogeneous. They depend on several parameters, but we are studying mainly a certain subfamily which is indexed by one parameter, r. As a special case...

We consider the problem of matching two shapes assuming these shapes are related by an elastic deformation. Using linearized elasticity theory and the finite element method we seek an elastic deformation that is caused by simple external boundary forces and accounts for the difference between the two shapes. Our main contribution is in proposing a cost function and an optimization procedure to ...

The symmetric difference is a robust operator for measuring the error of approximating one shape by another. Given two convex shapes P and C, we study the problem of minimizing the volume of their symmetric difference under all possible scalings and translations of C. We prove that the problem can be solved by convex programming. We also present a combinatorial algorithm for convex polygons in ...