Name
Abstract | ||
|---|---|---|
We present new results on the computational limitations of affine automata (AfAs). First, we show that using the endmarker does not increase the computational power of AfAs. Second, we show that the computation of bounded-error rational-valued AfAs can be simulated in logarithmic space. Third, we identify some logspace unary languages that are not recognized by algebraic-valued AfAs. Fourth, we show that using arbitrary real-valued transition matrices and state vectors does not increase the computational power of AfAs in the unbounded-error model. When focusing only the rational values, we obtain the the same result also for bounded error. As a consequence, we show that the class of bounded-error affine languages remains the same when the AfAs are restricted to use rational numbers only. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1007/s11047-020-09815-1 | NATURAL COMPUTING |
Keywords | DocType | Volume |
Non-classical models of automata, Affine automata, Logarithmic space, Generalized automata, Cutpoint languages, Bounded error | Journal | 20 |
Issue | ISSN | Citations |
2 | 1567-7818 | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mika Hirvensalo | 1 | 163 | 21.19 |
| Etienne Moutot | 2 | 1 | 1.71 |
| Abuzer Yakaryilmaz | 3 | 168 | 25.31 |