Mika Hirvensalo
 
 mikhirve@utu.fi +358 29 450 4325 +358 50 338 8034 Vesilinnantie 5 Turku  | 
- Reachability in Linear Recurrence Automata  (2024)  
- Lecture Notes in Computer Science
 
 - The membership problem for subsemigroups of GL2(Z) is NP-complete  (2024)  
- Information and Computation
 
 - A Riemann Hypothesis Analog for the Krawtchouk and Discrete Chebyshev Polynomials  (2022)  
- Journal of Mathematical Sciences
 
 - Riemann Hypothesis Property for The Convergents of a Continued Fraction Expansion  (2022)   Gogin Nikita, Hirvensalo Mika
 - A Riemann hypothesis analog for the Krawtchouk and discrete Chebyshev polynomials  (2021)  
- Zapiski Nauchnyh Seminarov Pomi
 
 - Computational limitations of affine automata and generalized affine automata  (2021)  
- Natural Computing
 
 - Non-Classical Models of Automata and Applications IX  (2021)   Hirvensalo Mika, Mráz František, Průša Daniel
 - On injectivity of quantum finite automata  (2021)  
- Journal of Computer and System Sciences
 
 - On the Moments of Squared Binomial Coefficients  (2020)  International Conference Polynomial Computer Algebra ‘2020; St. Petersburg, October 12–17 2020, Euler International Mathematical Institute Gogin Nikita, Hirvensalo Mika
 - Acceptance Ambiguity for Quantum Automata  (2019)  
- LIPICS – Leibniz international proceedings in informatics
 
 - Alternating, private alternating, and quantum alternating realtime automata  (2019)  
- Logical Methods in Computer Science
 
 - Computational Limitations of Affine Automata  (2019)  
- Lecture Notes in Computer Science
 
 - Proceedings of Workshop on Quantum Computing and Quantum Information  (2019)   Mika Hirvensalo, Abuzer Yakaryılmaz
 - Interference as a computational resource: a tutorial  (2018)  
- Natural Computing
 
 - On the Computational Power of Affine Automata  (2017)  
- Lecture Notes in Computer Science
 
 - On the Generating Function of Discrete Chebyshev Polynomials  (2017)  
- Journal of Mathematical Sciences
 
 - The Identity Problem for Matrix Semigroups in SL2(Z) is NP-complete  (2017)  SODA '17: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms Paul C. Bell, Mika Hirvensalo, Igor Potapov
 - Decision Problems on Unary Probabilistic and Quantum Automata  (2016)  
- Baltic Journal of Modern Computing
 
 - Non-Classical Models of Automata and Applications VI  (2016)  
- Fundamenta Informaticae
 
 - On the generating function of discrete Chebyshev polynomials  (2016)  
- Zapiski Nauchnyh Seminarov Pomi
 
 



