Skip to main content
SpringerLink
Log in

On the Computational Power of Affine Automata

  • Conference paper
  • First Online:
Language and Automata Theory and Applications (LATA 2017)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10168))

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. 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)

    Article  MathSciNet  MATH  Google Scholar 

  2. Ambainis, A., Yakaryılmaz, A.: Automata: from mathematics to applications. Automata Quantum Comput., to appear. arXiv:1507.01988

  3. 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)

  4. 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

    Google Scholar 

  5. Jeandel, E.: Topological automata. Theor. Comput. Syst. 40(4), 397–407 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  6. Kondacs, A., Watrous, J.: On the power of quantum finite state automata. In: FOCS 1997, pp. 66–75 (1997)

    Google Scholar 

  7. 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)

    Article  MathSciNet  MATH  Google Scholar 

  8. Paz, A.: Introduction to Probabilistic Automata. Academic Press, New York (1971)

    MATH  Google Scholar 

  9. Rabin, M.O.: Probabilistic automata. Inf. Control 6, 230–243 (1963)

    Article  MATH  Google Scholar 

  10. Sipser, M.: Introduction to the Theory of Computation, 3rd edn. Cengage Learning, Boston (2013)

    MATH  Google Scholar 

  11. Turakainen, P.: Generalized automata and stochastic languages. Proc. Am. Math. Soc. 21, 303–309 (1969)

    Article  MathSciNet  MATH  Google Scholar 

  12. Turakainen, P.: On nonstochastic languages and homomorphic images of stochastic languages. Inf. Sci. 24(3), 229–253 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  13. 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

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Statistics, University of Turku, 20014, Turku, Finland

    Mika Hirvensalo

  2. LIP, ENS de Lyon – CNRS – INRIA – UCBL – Université de Lyon, École Normale Supérieure de Lyon, 69007, Lyon, France

    Etienne Moutot

  3. Faculty of Computing, University of Latvia, Raina Bulv. 19, Riga, 1586, Latvia

    Abuzer Yakaryılmaz

  4. Turku Centre for Computer Science (TUCS), Turku, Finland

    Mika Hirvensalo

Authors
  1. Mika Hirvensalo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Etienne Moutot
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Abuzer Yakaryılmaz
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Mika Hirvensalo , Etienne Moutot or Abuzer Yakaryılmaz .

Editor information

Editors and Affiliations

  1. Umeå University, Umeå, Sweden

    Frank Drewes

  2. Rovira i Virgili University, Tarragona, Spain

    Carlos Martín-Vide

  3. University of Giessen, Giessen, Germany

    Bianca Truthe

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics

Search

Navigation