Related papers: Reducing complexity of tail-biting trellises

This paper describes techniques for growing classification and regression trees designed to induce visually interpretable trees. This is achieved by penalizing splits that extend the subset of features used in a particular branch of the…

The duality between controllability and observability enables methods developed for full-state control to be applied to full-state estimation, and vice versa. In applications in which control or estimation of all state variables is…

This research delves into the exact controllability of semilinear measure-driven integrodifferential systems in nonlocal settings. We provide sufficient controllability requirements using the measure of noncompactness and the M\"onch fixed…

We relate the notion of matroid pathwidth to the minimum trellis state-complexity (which we term trellis-width) of a linear code, and to the pathwidth of a graph. By reducing from the problem of computing the pathwidth of a graph, we show…

Recently it was shown that it is undecidable whether a term rewrite system can be proved terminating by a polynomial interpretation in the natural numbers. In this paper we show that this is also the case when restricting the…

We study irreducible restrictions from modules over symmetric groups to subgroups. We get reduction results which substantially restrict the classes of subgroups and modules for which this is possible. Such results are known when the…

Tail recursive functions allow for a wider range of optimisations than general recursive functions. For this reason, much research has gone into the transformation and optimisation of this family of functions, in particular those written in…

In this paper we introduce a technique to produce tighter cutting planes for mixed-integer non-linear programs. Usually, a cutting plane is generated to cut off a specific infeasible point. The underlying idea is to use the infeasible point…

We prove the existence of an algorithm which solves the reducibility problem in braid groups and runs in quadratic time with respect to the braid length for any fixed braid index.

A tree decomposition of the coordinates of a code is a mapping from the coordinate set to the set of vertices of a tree. A tree decomposition can be extended to a tree realization, i.e., a cycle-free realization of the code on the…

Solutions of a system of wave equations are constructed for both homogeneous and inhomogeneous Dirichlet boundary conditions at every regularity level. We prove that boundary observability, and thus boundary exact controllability, at some…

The verification of liveness conditions is an important aspect of state-based rigorous methods. This article addresses the extension of the logic of Event-B to a powerful logic, in which properties of traces of an Event-B machine can be…

We consider nonlinear scalar-input differential control systems in the vicinity of an equilibrium. When the linearized system at the equilibrium is controllable, the nonlinear system is smoothly small-time locally controllable, i.e.,…

We give a simple characterization of braids that can be unplaited keeping separately their upper ends and their lower ends tied together

Optimal Dirichlet boundary control for a fractional/normal evolution with a final observation is considered. The unique existence of the solution and the first-order optimality condition of the optimal control problem are derived. The…

We introduce a nonlocal control condition and the notion of approximate controllability for fractional order quasilinear control inclusions. Approximate controllability of a fractional control nonlocal delay quasilinear functional…

Reachability analysis is a powerful tool when it comes to capturing the behaviour, thus verifying the safety, of autonomous systems. However, general-purpose methods, such as Hamilton-Jacobi approaches, suffer from the curse of…

The richness of quantum theory's reversible dynamics is one of its unique operational characteristics, with recent results suggesting deep links between the theory's reversible dynamics, its local state space and the degree of non-locality…

In control theory, researchers need to understand a system's local and global behaviors in relation to its initial conditions. When discussing observability, the main focus is on the ability to analyze the system using an output space…

Reachable set computation is an important tool for analyzing control systems. Simulating a control system can show general trends, but a formal tool like reachability analysis can provide guarantees of correctness. Reachability analysis for…