Related papers: Logical equivalence between generalized urn models…
Let $G$ be a finite $p$-group and let Aut$(G)$ denote the full automorphism group of $G$. In the recent past, there has been interest in finding necessary and sufficient conditions on $G$ such that certain subgroups of Aut$(G)$ are equal.…
Generalised Probabilistic Theories (GPTs) provide a unifying framework encompassing classical theories, quantum theories, as well as hypothetical alternatives. We investigate the problem of extending a system with a finite set of…
Parikh automata extend finite automata by counters that can be tested for membership in a semilinear set, but only at the end of a run, thereby preserving many of the desirable algorithmic properties of finite automata. Here, we study the…
An automaton is history-deterministic if its nondeterminism can be resolved on the fly, only using the prefix of the word read so far. This mild form of nondeterminism has attracted particular attention for its applications in synthesis…
In this paper, we investigate the generalization of the Call-Put duality equality obtained in [1] for perpetual American options when the Call-Put payoff $(y-x)^+$ is replaced by $\phi(x,y)$. It turns out that the duality still holds under…
A condition characterizing the class of regular languages which have several nonisomorphic minimal reversible automata is presented. The condition concerns the structure of the minimum automaton accepting the language under consideration.…
The axioms of iteration theories, or iteration categories, capture the equational properties of fixed point operations in several computationally significant categories. Iteration categories may be axiomatized by the Conway identities and…
Nominal automata models serve as a formalism for data languages, and in fact often relate closely to classical register models. The paradigm of name allocation in nominal automata helps alleviate the pervasive computational hardness of…
We define an equivalence relation on propositions and a proof system where equivalent propositions have the same proofs. The system obtained this way resembles several known non-deterministic and algebraic lambda-calculi.
Non-commutativity is ubiquitous in mathematical modeling of reality and in many cases same algebraic structures are implemented in different situations. Here we consider the canonical commutation relation of quantum theory and discuss a…
The predicate complementary to the well-known Godel's provability predicate is defined. From its recursiveness new consequences concerning the incompleteness argumentation are drawn and extended to new results of consistency, completeness…
Automaton models are often seen as interpretable models. Interpretability itself is not well defined: it remains unclear what interpretability means without first explicitly specifying objectives or desired attributes. In this paper, we…
In this paper we provide a complete algebraic characterization of elementary equivalence of rings with a finitely generated additive group in the language of pure rings. The rings considered are arbitrary otherwise.
We introduce and study a unital version of shift equivalence for finite square matrices over the nonnegative integers. In contrast to the classical case, we show that unital shift equivalence does not coincide with one-sided eventual…
We produce arbitrarily large equivalence classes of matings with the aeroplane polynomial. These are obtained by a slight generalisation of the technique of proof of a similar result for Wittner captures.
We use the notion of a partial action of a monoid to introduce a generalization of automata, which we call "a preautomaton". We study properties of preautomata and of languages recognized by preautomata.
Weighted automata over the nonnegative reals form a fundamental model for quantitative languages. We show that, up to scaling, this model collapses to probabilistic automata. Concretely, we prove that every weighted automaton whose…
We show that a special case of the Feferman-Vaught composition theorem gives rise to a natural notion of automata for finite words over an infinite alphabet, with good closure and decidability properties, as well as several logical…
A multilateral Bailey Lemma is proved, and multiple analogues of the Rogers--Ramanujan identities and Euler's Pentagonal Theorem are constructed as applications. The extreme cases of the Andrews--Gordon identities are also generalized using…
A universal Turing machine is a powerful concept - a single device can compute any function that is computable. A universal spin model, similarly, is a class of physical systems whose low energy behavior simulates that of any spin system.…