Related papers: Weak morphisms of higher dimensional automata
Alternating timed automata on infinite words are considered. The main result is a characterization of acceptance conditions for which the emptiness problem for these automata is decidable. This result implies new decidability results for…
Neural systems, artificial and biological, show similar representations of inputs when optimized to perform similar tasks. In visual systems optimized for tasks similar to object recognition, we propose that representation similarities…
Higher-order abstract GSOS is a recent extension of Turi and Plotkin's framework of Mathematical Operational Semantics to higher-order languages. The fundamental well-behavedness property of all specifications within the framework is that…
We prove that for a given deterministic top-down transducer with look-ahead it is decidable whether or not its translation is definable (1)~by a linear top-down tree transducer or (2)~by a tree homomorphism. We present algorithms that…
Morphic sequences form a natural class of infinite sequences, extending the well-studied class of automatic sequences. Where automatic sequences are known to have several equivalent characterizations and the class of automatic sequences is…
Identifying molecular signatures from complex disease patients with underlying symptomatic similarities is a significant challenge in the analysis of high dimensional multi-omics data. Topological data analysis (TDA) provides a way of…
A new approach is applied to the 1D Anderson model by making use of a two-dimensional Hamiltonian map. For a weak disorder this approach allows for a simple derivation of correct expressions for the localization length both at the center…
We generalize the notion of an exact category and introduce weakly exact categories. A proof of the snake lemma in this general setting is given. Some applications are given to illustrate how one can do homological algebra in a weakly exact…
This thesis investigates the central role of homomorphism problems (structure-preserving maps) in two complementary domains: database querying over finite, graph-shaped data, and constraint solving over (potentially infinite) structures.…
A topological space ${\mathcal X}$ is reversible iff each continuous bijection (condensation) $f: {\mathcal X} \rightarrow {\mathcal X}$ is a homeomorphism; weakly reversible iff whenever ${\mathcal Y}$ is a space and there are…
Using the two way distance, we introduce the concepts of weak metric dimension of a strongly connected digraph $\Gamma$. We first establish lower and upper bounds for the number of arcs in $\Gamma$ by using the diameter and weak metric…
We are dealing with the complexity of the homeomorphism equivalence relation on some classes of metrizable compacta from the viewpoint of invariant descriptive set theory. We prove that the homeomorphism equivalence relation of absolute…
One of the most prominent tools for abstract argumentation is the Dung's framework, AF for short. It is accompanied by a variety of semantics including grounded, complete, preferred and stable. Although powerful, AFs have their…
We define the concept of weak pseudotwistor for an algebra $(A, \mu)$ in a monoidal category $\mathcal{C}$, as a morphism $T:A\otimes A\rightarrow A\otimes A$ in $\mathcal{C}$, satisfying some axioms ensuring that $(A, \mu \circ T)$ is also…
In this paper we adopt a category-theoretic approach to the conception of automata classes enjoying minimization by design. The main instantiation of our construction is a new class of automata that are hybrid between deterministic automata…
We investigate the tree-to-tree functions computed by "affine $\lambda$-transducers": tree automata whose memory consists of an affine $\lambda$-term instead of a finite state. They can be seen as variations on Gallot, Lemay and Salvati's…
Recent algorithmic advances in algebraic automata theory drew attention to semigroupoids (semicategories). These are mathematical descriptions of typed computational processes, but they have not been studied systematically in the context of…
We introduce notions of continuous orbit equivalence and strong (respective, weak) continuous orbit equivalence for automorphism systems of \'{e}tale equivalence relations, and characterize them in terms of the semi-direct product…
We consider symmetric pairs of Lie superalgebras which are strongly reductive and of even type, and introduce a graded Harish-Chandra homomorphism. We prove that its image is a certain explicit filtered subalgebra of the Weyl invariants on…
We present a semantic parser for Abstract Meaning Representations which learns to parse strings into tree representations of the compositional structure of an AMR graph. This allows us to use standard neural techniques for supertagging and…