Mika Hirvensalo

University of Turku — Finland

Computer Science · Physical Sciences

14h-index838citations84works0.02yr avg
OpenAlex↗ORCID↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

semigroups and automata theory(30), Quantum Computing Algorithms and Architecture(29), Computability, Logic, AI Algorithms(15), DNA and Biological Computing(14), Advanced Algebra and Logic(11)

Publications84 total

Reachability in Linear Recurrence Automata
Lecture notes in computer science·2024
The membership problem for subsemigroups of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.svg"><mml:msub><mml:mrow><mml:mi mathvariant="normal">GL</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi mathvariant="double-struck">Z</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math> is NP-complete
Information and Computation·2023· 2 citedOpen Access
A Riemann Hypothesis Analog for the Krawtchouk and Discrete Chebyshev Polynomials
Journal of Mathematical Sciences·2022Open Access
On injectivity of quantum finite automata
Journal of Computer and System Sciences·2021· 3 citedOpen Access
Preface
Fundamenta Informaticae·2021
Correction to: Computational limitations of affine automata and generalized affine automata
Natural Computing·2021Open Access
Computational limitations of affine automata and generalized affine automata
Natural Computing·2021· 3 citedOpen Access
Alternating, private alternating, and quantum alternating realtime automata
Logical Methods in Computer Science·2019Open Access
Alternating, private alternating, and quantum alternating realtime automata
SHILAP Revista de lepidopterología·2019Open Access
Proceedings of Workshop on Quantum Computing and Quantum Information
UTUPub (University of Turku)·2019· 1 cited
Acceptance Ambiguity for Quantum Automata
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2019· 1 citedOpen Access
Computational Limitations of Affine Automata
Lecture notes in computer science·2019Open Access
Interference as a computational resource: a tutorial
Natural Computing·2017· 2 cited
On the Generating Function of Discrete Chebyshev Polynomials
Journal of Mathematical Sciences·2017· 21 cited
On the Computational Power of Affine Automata
Lecture notes in computer science·2017· 10 citedOpen Access
The Identity Problem for Matrix Semigroups in SL<sub>2</sub>(ℤ) is <b>NP</b>-complete
2017· 9 citedOpen Access
Preface
Fundamenta Informaticae·2016Open Access
Decision Problems on Unary Probabilistic and Quantum Automata
Baltic Journal of Modern Computing·2016Open Access
Preface, Fundamenta Informaticae
2016
Preface
Fundamenta Informaticae·2015Open Access
page 1 of 5Next →

Frequent Co-authors

Vesa Halava(12), Paul C. Bell(7), Tero Harju(6), Abuzer Yakaryılmaz(4), Ronald de Wolf(3), Igor Potapov(3), Juhani Karhumäki(3), N. Gogin(2), Etienne Moutot(2), Alexander Rabinovich(1), Sebastian Seibert(1), Hüseyin Demirci(1), Klaus Reinhardt(1), A. C. Cem Say(1), Jyrki Lahtonen(1)