We introduce the affine OBDD model and show that zero-error affine OBDDs can be
exponentially narrower than bounded-error unitary and probabilistic OBDDs on certain …

In this work we study a non-linear generalization based on affine transformations of
probabilistic and quantum automata proposed recently by Díaz-Caro and Yakaryılmaz (in …

We introduce the affine OBDD model and show that zero-error affine OBDDs can be
exponentially narrower than bounded-error unitary and probabilistic OBDDs on certain …

We introduce an affine generalization of counter automata, and analyze their ability as well
as affine finite automata. Our contributions are as follows. We show that there is a language …

We initiate the study of the verification power of Affine finite automata (AfA) as a part of Arthur-
Merlin (AM) proof systems. We show that every unary language is verified by a real-valued …

We introduce the affine OBDD model and show that zero-error affine OBDDs can be
exponentially narrower than bounded-error unitary and probabilistic OBDDs on certain …

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 …

Affine finite automata (AfAs) can be more succinct than probabilistic and quantum finite
automata when recognizing some regular languages with bounded error. In this paper, we …

We present two new results on the computational limitations of affine automata. First, we
show that the computation of bounded-error rational-valued affine automata is simulated in …

arxiv:2212.11834v1 [cs.FL] 22 Dec 2022 Page 1 arxiv:2212.11834v1 [cs.FL] 22 Dec 2022
Real-valued affine automata compute beyond Turing machines∗ Abuzer Yakaryılmaz1,2 …