A Survey on Analog Models of Computation Page 1 Chapter 6 A Survey on Analog Models of
Computation Olivier Bournez and Amaury Pouly Abstract We present a survey on analog …

Generally, unitary transformations limit the computational power of quantum finite automata
(QFA). In this paper, we study a generalized model named one-way general quantum finite …

We introduce a new computing model of one-way quantum finite automata (1QFA), namely,
one-way quantum finite automata together with classical states (1QFAC). We show that the …

Multi-letter quantum finite automata (QFAs) can be thought of quantum variants of the one-
way multi-head finite automata (Hromkovič, Acta Informatica 19: 377–384, 1983). It has been …

We prove homotopical rigidity of expanding dynamical systems, by showing that they are
determined by a group-theoretic invariant. We use this to show that the Julia set of every …

We investigate the computational power of affine automata (AfAs) introduced in [4]. In
particular, we present a simpler proof for how to change the cutpoint for any affine language …

In classical computation, a “write-only memory”(WOM) is little more than an oxymoron, and
the addition of WOM to a (deterministic or probabilistic) classical computer brings no …

It is a widely believed, though unproven, conjecture that the capability of postselection
increases the language recognition power of both probabilistic and quantum polynomial …

We present new results on the computational limitations of affine automata (AfAs). First, we
show that using the endmarker does not increase the computational power of AfAs. Second …

We prove that endowing a real-time probabilistic or quantum computer with the ability of
postselection increases its computational power. For this purpose, we provide a new model …