Paper Info
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.
Year
DOI
Venue
2017
10.1007/978-3-319-53733-7_30
Lecture Notes in Computer Science
Keywords
DocType
Volume
Non-classical models of automata,Affine automata,Cutpoint languages,Bounded error,Compact sets,Error reduction
Conference
10168
ISSN
Citations 
PageRank 
0302-9743
0
0.34
References 
Authors
0
3
Name
Order
Citations
PageRank
Mika Hirvensalo116321.19
Etienne Moutot211.71
Abuzer Yakaryilmaz316825.31