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.
M. Hirvensalo—Partially supported by Väisälä Foundation.
E. Moutot—Partially supported by TUCS COM\({}^3\)-project and ANR project CoCoGro (ANR-16-CE40-0005).
A. Yakaryılmaz—Partially supported by TUCS COM\({}^3\)-project and ERC Advanced Grant MQC.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Ambainis, A., Beaudry, M., Golovkins, M., Kikusts, A., Mercer, M., Thérien, D.: Algebraic results on quantum automata. Theor. Comput. Syst. 39(1), 165–188 (2006)
Ambainis, A., Yakaryılmaz, A.: Automata: from mathematics to applications. Automata Quantum Comput., to appear. arXiv:1507.01988
Belovs, A., Montoya, J.A., Yakaryılmaz, A.: Can one quantum bit separate any pair of words with zero-error? Technical report. arXiv:1602.07967 (2016)
Díaz-Caro, A., Yakaryılmaz, A.: Affine computation and affine automaton. In: Kulikov, A.S., Woeginger, G.J. (eds.) CSR 2016. LNCS, vol. 9691, pp. 146–160. Springer, Heidelberg (2016). doi:10.1007/978-3-319-34171-2_11. arXiv:1602.04732
Jeandel, E.: Topological automata. Theor. Comput. Syst. 40(4), 397–407 (2007)
Kondacs, A., Watrous, J.: On the power of quantum finite state automata. In: FOCS 1997, pp. 66–75 (1997)
Li, L., Qiu, D., Zou, X., Li, L., Wu, L., Mateus, P.: Characterizations of one-way general quantum finite automata. Theoret. Comput. Sci. 419, 73–91 (2012)
Paz, A.: Introduction to Probabilistic Automata. Academic Press, New York (1971)
Rabin, M.O.: Probabilistic automata. Inf. Control 6, 230–243 (1963)
Sipser, M.: Introduction to the Theory of Computation, 3rd edn. Cengage Learning, Boston (2013)
Turakainen, P.: Generalized automata and stochastic languages. Proc. Am. Math. Soc. 21, 303–309 (1969)
Turakainen, P.: On nonstochastic languages and homomorphic images of stochastic languages. Inf. Sci. 24(3), 229–253 (1981)
Villagra, M., Yakaryılmaz, A.: Language recognition power and succinctness of affine automata. In: Amos, M., Condon, A. (eds.) UCNC 2016. LNCS, vol. 9726, pp. 116–129. Springer, Heidelberg (2016). doi:10.1007/978-3-319-41312-9_10
Author information
Authors and Affiliations
Corresponding authors
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Hirvensalo, M., Moutot, E., Yakaryılmaz, A. (2017). On the Computational Power of Affine Automata. In: Drewes, F., Martín-Vide, C., Truthe, B. (eds) Language and Automata Theory and Applications. LATA 2017. Lecture Notes in Computer Science(), vol 10168. Springer, Cham. https://doi.org/10.1007/978-3-319-53733-7_30
Download citation
DOI: https://doi.org/10.1007/978-3-319-53733-7_30
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-53732-0
Online ISBN: 978-3-319-53733-7
eBook Packages: Computer ScienceComputer Science (R0)