Computational Limitations of Affine Automata
Formal Languages and Automata Theory
2019-04-05 v1
Abstract
We present two new results on the computational limitations of affine automata. First, we show that the computation of bounded-error rational-values 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.
Keywords
Cite
@article{arxiv.1904.02428,
title = {Computational Limitations of Affine Automata},
author = {Mika Hirvensalo and Etienne Moutot and Abuzer Yakaryılmaz},
journal= {arXiv preprint arXiv:1904.02428},
year = {2019}
}
Comments
Accepted in Unconventional Computation and Natural Computation (UCNC) 2019