Related papers: Rational Gluing in Edge Replacement Systems
Relation-changing modal logics are extensions of the basic modal logic that allow changes to the accessibility relation of a model during the evaluation of a formula. In particular, they are equipped with dynamic modalities that are able to…
This paper introduces robust differential dynamic logic (a fragment of differential dynamic logic) to specify and reason about robust hybrid systems. Practically meaningful syntactic restrictions naturally ensure that definable properties…
Skeleton is a new notion designed for constructing space-filling curves of self-similar sets. It is shown in [Dai, Rao and Zhang, Space-filling curves of self-similar sets (II): Edge-to-trail substitution…
An automata network (AN) is a finite graph where each node holds a state from a finite alphabet and is equipped with a local map defining the evolution of the state of the node depending on its neighbors. They are studied both from the…
We automatically verify the crucial steps in the original proof of correctness of an algorithm which, given a geometric graph satisfying certain additional properties removes edges in a systematic way for producing a connected graph in…
In this paper we present analytic tableau proof systems for various justification logics. We show that the tableau systems are sound and complete with respect to Mkrtychev models. In order to prove the completeness of the tableaux, we give…
This paper contains results related to synthesis and presentation of abstract automata by fragments of behaviour and investigates the structure of the classes of finite connected initial output-less automata specified by systems of defining…
The present paper introduces and studies an alternative concept of two-way finite automata called input-erasing two-way finite automata. Like the original model, these new automata can also move the reading head freely left or right on the…
Substitute relationships are fundamental to people's daily lives across various domains. This study aims to comprehend and predict substitute relationships among products in diverse fields, extensively analyzing the application of machine…
We study the graphs formed from instances of the stable matching problem by connecting pairs of elements with an edge when there exists a stable matching in which they are matched. Our results include the NP-completeness of recognizing…
In this note, we discuss families of orbifolds underlying 6D SCFT F-theory models and find a novel pairing structure in the SCFT landscape. Inspection of the rational functions defining models with a common F-theory endpoint leads us to…
We present a theory of automata with boundary for designing, modelling and analysing distributed systems. Notions of behaviour, design and simulation appropriate to the theory are defined. The problem of model checking for deadlock…
We give a new proof of the decidability of reachability in alternating pushdown systems, showing that it is a simple consequence of a cut-elimination theorem for some natural-deduction style inference systems. Then, we show how this result…
State reduction of finite automata plays a significant role in improving efficiency in formal verification, pattern recognition, and machine learning, where automata-based models are widely used. While deterministic automata have…
We study the separability of permutationally symmetric quantum states. We show that for bipartite symmetric systems most of the relevant entanglement criteria coincide. However, we provide a method to generate examples of bound entangled…
Fracture produces new mesh fragments that introduce additional degrees of freedom in the system dynamics. Existing finite element method (FEM) based solutions suffer from an explosion in computational cost as the system matrix size…
Since wire bearings were patented in 1936, they have been used in applications where weight saving is a key aspect. Nevertheless, little work can be found in literature regarding their structural behaviour. In order to predict how a wire…
The research in topological materials and meta-materials reached maturity and is now gradually entering the phase of practical applications and devices. However, scaling down the experimental demonstrations definitely presents a challenge.…
In this paper we develop cyclic proof systems for the problem of inclusion between the least sets of models of mutually recursive predicates, when the ground constraints in the inductive definitions belong to the quantifier-free fragments…
We introduced a family of infinite graphs directly associated with a class of von Neumann automaton model A_{G}. These are finite state models used in symbolic dynamics: stimuli models and in control theory. In the context of groupoid von…