Name
Abstract | ||
|---|---|---|
We introduce a quantum-like classical computational concept, called affine computation, as a generalization of probabilistic computation. After giving the basics of affine computation, we define affine finite automata AfA and compare it with quantum and probabilistic finite automata QFA and PFA, respectively with respect to three basic language recognition modes. We show that, in the cases of bounded and unbounded error, AfAs are more powerful than QFAs and PFAs, and, in the case of nondeterministic computation, AfAs are more powerful than PFAs but equivalent to QFAs. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1007/978-3-319-34171-2_11 | CSR |
DocType | Volume | ISSN |
Conference | abs/1602.04732 | LNCS 9691:146-160, 2016 |
Citations | PageRank | References |
3 | 0.47 | 8 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Alejandro Díaz-Caro | 1 | 33 | 7.91 |
| Abuzer Yakaryilmaz | 2 | 168 | 25.31 |