相关论文: Weak equivalence of higher-dimensional automata

In this paper we regard languages and their acceptors -- such as deterministic or weighted automata, transducers, or monoids -- as functors from input categories that specify the type of the languages and of the machines to categories that…

Elementary Cellular Automata (ECA) are a well-studied computational universe that is, despite its simple configurations, capable of impressive computational variety. Harvesting this computation in a useful way has historically shown itself…

In this paper we give an overview of results on the analysis of parametric linear hybrid automata, and of systems of similar linear hybrid automata: We present possibilities of describing systems with a parametric (i.e. not explicitly…

We use homological perturbation machinery specific for the algebra category [P. Real. Homological Perturbation Theory and Associativity. Homology, Homotopy and Applications vol. 2, n. 5 (2000) 51-88] to give an algorithm for computing the…

We introduce higher-dimensional automata for infinite interval ipomsets ($\omega$-HDAs). We define key concepts from different points of view, inspired from their finite counterparts. Then we explore languages recognized by $\omega$-HDAs…

The formalism of weak measurement in quantum mechanics has revealed profound connections between measurement theory, quantum foundations, and signal processing. In this paper, we develop a pointer-free derivation of superoscillations,…

We consider $p$-weak differentiable structures that were recently introduced by the first and last named authors, and prove that the product of $p$-weak charts is a $p$-weak chart. This implies that the product of two spaces with a $p$-weak…

In this paper we study finite higher-dimensional automata (HDAs) from the logical point of view. Languages of HDAs are sets of finite bounded-width interval pomsets with interfaces (iiPoms<=k) closed under order extension. We prove that…

We introduce a new extragradient iterative process, motivated and inspired by [S. H. Khan, A Picard-Mann Hybrid Iterative Process, Fixed Point Theory and Applications, doi:10.1186/1687-1812-2013-69], for finding a common element of the set…

Hyperdimensional computing (HDC), also referred to as vector symbolic architectures (VSA), represents information with high-dimensional vectors and a compact algebra of primitives. This paper establishes an explicitly unitary embedding from…

In this report we study the problem of minimising deterministic automata over finite and infinite words. Deterministic finite automata are the simplest devices to recognise regular languages, and deterministic Buchi, Co-Buchi, and parity…

In this paper we give a criterion that characterizes equivalent weak crossed products. By duality, we obtain a similar result for weak crossed coproducts and, as a consequence, we find the conditions that assures the equivalence between two…

Visibly pushdown transducers (VPTs) are visibly pushdown automata extended with outputs. They have been introduced to model transformations of nested words, i.e. words with a call/return structure. As trees and more generally hedges can be…

We present a direct transformation of weak alternating $\omega$-automata into equivalent backward deterministic $\omega$-automata and show (1) how it can be used to obtain a transformation of non-deterministic B\"uchi automata into…

We present a direct comparison studying equilibration through kinetic theory at weak coupling and through holography at strong coupling in the same set-up. The set-up starts with a homogeneous thermal state, which then smoothly transitions…

This paper introduces a new machine architecture for evaluating lambda expressions using the normal-order reduction, which guarantees that every lambda expression will be evaluated if the expression has its normal form and the system has…

Autonomous robotic systems applied to new domains require an abundance of expensive, pixel-level dense labels to train robust semantic segmentation models under full supervision. This study proposes a model-agnostic Depth Edge Alignment…

The basic notions of category theory, such as limit, adjunction, and orthogonality, all involve assertions of the existence and uniqueness of certain arrows. Weak notions arise when one drops the uniqueness requirement and asks only for…

We explore the transferability of a multilingual neural machine translation model to unseen languages when the transfer is grounded solely on the cross-lingual word embeddings. Our experimental results show that the translation knowledge…

Automata learning is a popular technique for inferring minimal automata through membership and equivalence queries. In this paper, we generalise learning to the theory of coalgebras. The approach relies on the use of logical formulas as…