Reversible finite automata with halting states (RFA) were first considered by Ambainis and Freivalds to facilitate the research of KondacsWatrous quantum finite automata. In this ...
In this paper we produce a finite algebra which generates a variety with a PSPACE-complete membership problem. We produce another finite algebra with a γ function that grows exp...
Abstract. The main result is that for every recursively enumerable existential consistent theory (in the usual language of group theory), there exists a finitely presented SQ-univ...
We present computational techniques for automatically generating algebraic (polynomial equality) invariants for algebraic hybrid systems. Such systems involve ordinary differentia...
Relation were invented by Tarski and his collaborators in the middle of the twentieth century. The concept of integrality arose naturally early in the history of the subject, and s...