Related papers: Characteristic Points of Recursive Systems

The literature on concurrency theory offers a wealth of examples of characteristic-formula constructions for various behavioural relations over finite labelled transition systems and Kripke structures that are defined in terms of fixed…

Over an algebraically closed field of positive characteristic, there exist rational functions with only one critical point. We give an elementary characterization of these functions in terms of their continued fraction expansions. Then we…

We consider estimation procedures which are recursive in the sense that each successive estimator is obtained from the previous one by a simple adjustment. We propose a wide class of recursive estimation procedures for the general…

We solve the problem of characteristic numbers of elliptic curves in any dimensional projective space The answers are given in the form of effective recursions. Many numerical examples are provided. A C++ program implementing all the…

Algebraic characterizations of the computational aspects of functions defined over the real numbers provide very effective tool to understand what computability and complexity over the reals, and generally over continuous spaces, mean. This…

In this paper we give a method, based on the characteristic function of a set, to solve some difficult problems of set theory in undergraduate research.

In this article one builds a class of recursive sets, one establishes properties of these sets, and one proposes applications.

This paper is an update and extension of a result the authors first proved in 2003. The goal of this paper is to study factors which are known to be L^2-characteristic for certain nonconventional averages and prove that these factors are…

We discuss and prove a number of results for calculating characteristic cycles, or graded, enriched characteristic cycles. We concentrate particularly on results related to hypersurfaces.

The problem of calculating multicanonical parameters recursively is discussed. I describe in detail a computational implementation which has worked reasonably well in practice.

Natural language processing has greatly benefited from the introduction of the attention mechanism. However, standard attention models are of limited interpretability for tasks that involve a series of inference steps. We describe an…

Recurrence is a fundamental property of dynamical systems, which can be exploited to characterise the system's behaviour in phase space. A powerful tool for their visualisation and analysis called recurrence plot was introduced in the late…

We consider estimation procedures which are recursive in the sense that each successive estimator is obtained from the previous one by a simple adjustment. We study rate of convergence of recursive estimation procedures for the general…

We derive recursive equations for the characteristic numbers of rational nodal plane curves with at most one cusp, subject to point conditions, tangent conditions and flag conditions, developing techniques akin to quantum cohomology on a…

We define recurrence matrices and study a few properties (links with automatic sequences, branch groups etc.) of them.

Prompted by modern technologies in data acquisition, the statistical analysis of spatially distributed function-valued quantities has attracted a lot of attention in recent years. In particular, combinations of functional variables and…

In the literature the empirical characteristic function method is presented as an off-line identification method. While the results of the off-line methods are attractive, the proposed algorithms are ill-conditioned in many cases so that…

This paper is concerned with the problem of representing and learning a linear transformation using a linear neural network. In recent years, there has been a growing interest in the study of such networks in part due to the successes of…

In this paper the problem of retrospective change-point detection and estimation in multivariate linear models is considered. The lower bounds for the error of change-point estimation are proved in different cases (one change-point:…

A general framework for the connection between characteristic formulae and behavioral semantics is described in [2]. This approach does not suitably cover semantics defined by nested fixed points, such as the n-nested simulation semantics…