Related papers: Partially Ordered Two-way B\"uchi Automata
This paper deals with the controllability for a class of non-autonomous neutral differential equations of fractional order with infinite delay in an abstract space. The semi-group theory of bounded linear operators, fractional calculus, and…
We show that deterministic finite automata equipped with $k$ two-way heads are equivalent to deterministic machines with a single two-way input head and $k-1$ linearly bounded counters if the accepted language is strictly bounded, i.e., a…
Ordered binary decision diagrams (OBDDs) are a fundamental data structure for the manipulation of Boolean functions, with strong applications to finite-state symbolic model checking. OBDDs allow for efficient algorithms using top-down…
Nonuniform families of polynomial-size finite automata and pushdown automata respectively have strong connections to nonuniform-NL and nonuniform-LOGCFL. We examine the behaviors of unambiguous and co-nondeterministic computations produced…
We describe a history-deterministic B\"uchi automaton that has strictly less states than every language-equivalent deterministic B\"uchi automaton. This solves a problem that had been open since the introduction of history-determinism and…
In this paper, we introduce rerailing automata for $\omega$-regular languages. They generalize both deterministic parity (DPW) and minimized history-deterministic co-B\"uchi automata (with transition based acceptance, HdTbcBW) while…
The fractional order system, which is described by the fractional order derivative and integral, has been studied in many engineering areas. Recently, the concept of fractional order has been generalized to the distributed order concept,…
In this paper, we propose a new control design scheme for solving the obstacle avoidance problem for nonlinear driftless control-affine systems. The class of systems under consideration satisfies controllability conditions with iterated Lie…
An initial-boundary value problem with a Caputo time derivative of fractional order $\alpha\in(0,1)$ is considered, solutions of which typically exhibit a singular behaviour at an initial time. An L2-type discrete fractional-derivative…
It was proved few years ago that classes of Boolean functions definable by means of functional equations \cite{EFHH}, or equivalently, by means of relational constraints \cite{Pi2}, coincide with initial segments of the quasi-ordered set…
The linear-time simulation of 2-way deterministic pushdown automata (2DPDA) by the Cook and Jones constructions is revisited. Following the semantics-based approach by Jones, an interpreter is given which, when extended with random-access…
We study the problem of optimally managing an inventory with unknown demand trend. Our formulation leads to a stochastic control problem under partial observation, in which a Brownian motion with non-observable drift can be singularly…
We study whether second-order systems can be made to behave like prescribed first-order dynamical systems through feedback control. More precisely, we study whether prescribed vector fields on compact smooth manifolds, viewed geometrically…
In this paper we study the logical aspects of branching automata, as defined by Lodaya and Weil. We first prove that the class of languages of finite N-free posets recognized by branching automata is closed under complementation. Then we…
In \cite{LPP:2025}, it was shown that, in arbitrary dimension, the spatial semi-discretization of a controlled stochastic parabolic operator is generically not null-controllable. Nevertheless, $\phi$-null controllability results remain…
This paper introduces a new kind of propositional encoding for reasoning about partial orders. The symbols in an unspecified partial order are viewed as variables which take integer values and are interpreted as indices in the order. For a…
Let $I_{\alpha}$ be the linear and $\mathcal{I}_{\alpha}$ be the bilinear fractional integral operators. In the linear setting, it is known that the two-weight inequality holds for the first order commutators of $I_{\alpha}$. But the method…
Lately, there have been intensive studies on strengths and limitations of nonuniform families of promise decision problems solvable by various types of polynomial-size finite automata families, where ``polynomial-size'' refers to the…
During the last decades, a lot of effort was put into identifying decidable fragments of first-order logic. Such efforts gave birth, among the others, to the two-variable fragment and the guarded fragment, depending on the type of…
In the propositional modal (and algebraic) treatment of two-variable first-order logic equality is modelled by a `diagonal' constant, interpreted in square products of universal frames as the identity (also known as the `diagonal')…