INVESTIGADORES
DÍAZ CARO Alejandro
artículos
Título:
Affine computation and affine automaton
Autor/es:
ALEJANDRO DÍAZ CARO; ABUZER YAKARYILMAZ
Revista:
LECTURE NOTES IN COMPUTER SCIENCE
Editorial:
Springer-Verlag
Referencias:
Lugar: New York; Año: 2016 vol. 9691 p. 146 - 160
ISSN:
0302-9743
Resumen:
We introduce a quantum-like classical computational model, called affinecomputation, as a generalization of probabilistic computation. After giving thebasics of affine computation, we define affine finite automata (AfA) andcompare it with quantum and probabilistic finite automata (QFA and PFA,respectively) with respect to three basic language recognition modes. We showthat, in the cases of bounded and unbounded error, AfAs are more powerful thanQFAs and PFAs, and, in the case of nondeterministic computation, AfAs are morepowerful than PFAs but equivalent to QFAs.
