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 logarithmic space. Second, we give an impossibility result for algebraic-valued affine automata. As a result, we identify some unary languages (in logarithmic space) that are not recognized by algebraic-valued affine automata with cutpoints.
CITATION STYLE
Hirvensalo, M., Moutot, E., & Yakaryılmaz, A. (2019). Computational Limitations of Affine Automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11493 LNCS, pp. 108–121). Springer Verlag. https://doi.org/10.1007/978-3-030-19311-9_10
Mendeley helps you to discover research relevant for your work.