On the Computational Power of Affine Automata
We investigate the computational power of affine automata (AfAs) introduced in . In particular, we present a simpler proof for how to change the cutpoint for any affine language and a method how to reduce error in bounded error case. Moreover, we address to the question of  by showing that any affine language can be recognized by an AfA with certain limitation on the entries of affine states and transition matrices. Lastly, we present the first languages shown to be not recognized by AfAs with bounded-error.
KeywordsNon-classical models of automata Affine automata Cutpoint languages Bounded error Compact sets Error reduction
- 2.Ambainis, A., Yakaryılmaz, A.: Automata: from mathematics to applications. Automata Quantum Comput., to appear. arXiv:1507.01988
- 3.Belovs, A., Montoya, J.A., Yakaryılmaz, A.: Can one quantum bit separate any pair of words with zero-error? Technical report. arXiv:1602.07967 (2016)
- 6.Kondacs, A., Watrous, J.: On the power of quantum finite state automata. In: FOCS 1997, pp. 66–75 (1997)Google Scholar