@inproceedings{886e6c2e140b4ba384ee83572f707554,
title = "On the computational power of affine automata",
abstract = "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 and a method how to reduce error in bounded error case. Moreover, we address to the question of [4] 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.",
keywords = "Affine automata, Bounded error, Compact sets, Cutpoint languages, Error reduction, Non-classical models of automata",
author = "Mika Hirvensalo and Etienne Moutot and Abuzer Yakaryılmaz",
note = "Publisher Copyright: {\textcopyright} Springer International Publishing AG 2017.; 11th International Conference on Language and Automata Theory and Applications, LATA 2017 ; Conference date: 06-03-2017 Through 09-03-2017",
year = "2017",
doi = "10.1007/978-3-319-53733-7\_30",
language = "English",
isbn = "9783319537320",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "405--417",
editor = "Frank Drewes and Carlos Mart{\'i}n-Vide and Bianca Truthe",
booktitle = "Language and Automata Theory and Applications - 11th International Conference, LATA 2017, Proceedings",
address = "Germany",
}