Mika Hirvensalo

Publication Activity (10 Years)

Years Active: 1997-2024
Publications (10 Years): 17

Top Topics

Finite Automata

Piecewise Affine

Multicriteria Decision

Top Venues

Fundam. Informaticae

J. Comput. Syst. Sci.

Publications

Paul C. Bell, Mika Hirvensalo, Igor Potapov
The membership problem for subsemigroups of GL2(Z) is NP-complete. Inf. Comput. 296 (2024)
Paul C. Bell, Mika Hirvensalo
On injectivity of quantum finite automata. J. Comput. Syst. Sci. 122 (2021)
Mika Hirvensalo, Etienne Moutot, Abuzer Yakaryilmaz
Correction to: Computational limitations of affine automata and generalized affine automata. Nat. Comput. 20 (2) (2021)
Mika Hirvensalo, Etienne Moutot, Abuzer Yakaryilmaz
Computational limitations of affine automata and generalized affine automata. Nat. Comput. 20 (2) (2021)
Mika Hirvensalo, Etienne Moutot, Abuzer Yakaryilmaz
Computational Limitations of Affine Automata. CoRR (2019)
Paul C. Bell, Mika Hirvensalo
Acceptance Ambiguity for Quantum Automata. MFCS (2019)
Mika Hirvensalo, Etienne Moutot, Abuzer Yakaryilmaz
Computational Limitations of Affine Automata. UCNC (2019)
Paul C. Bell, Mika Hirvensalo
Acceptance Ambiguity for Quantum Automata. CoRR (2019)
Gökalp Demirci, Mika Hirvensalo, Klaus Reinhardt, A. C. Cem Say, Abuzer Yakaryilmaz
Alternating, private alternating, and quantum alternating realtime automata. Log. Methods Comput. Sci. 15 (3) (2019)
Mika Hirvensalo
Interference as a computational resource: a tutorial. Nat. Comput. 17 (1) (2018)
Mika Hirvensalo, Etienne Moutot, Abuzer Yakaryilmaz
On the Computational Power of Affine Automata. LATA (2017)
Paul C. Bell, Mika Hirvensalo, Igor Potapov
(ℤ) is NP-complete. SODA (2017)
Mika Hirvensalo, Abuzer Yakaryilmaz
Decision problems on unary probabilistic and quantum automata. CoRR (2016)
Suna Bensch, Rudolf Freund, Mika Hirvensalo, Friedrich Otto
Preface. Fundam. Informaticae 148 (3-4) (2016)
Mika Hirvensalo, Abuzer Yakaryilmaz
Decision Problems on Unary Probabilistic and Quantum Automata. Balt. J. Mod. Comput. 4 (4) (2016)
Mika Hirvensalo, Etienne Moutot, Abuzer Yakaryilmaz
On the computational power of affine automata. CoRR (2016)
Suna Bensch, Frank Drewes, Mika Hirvensalo, Friedrich Otto
Preface. Fundam. Informaticae 136 (1-2) (2015)
H. Gökalp Demirci, Mika Hirvensalo, Klaus Reinhardt, A. C. Cem Say, Abuzer Yakaryilmaz
Classical and quantum realtime alternating automata. NCMA (2014)
H. Gökalp Demirci, Mika Hirvensalo, Klaus Reinhardt, A. C. Cem Say, Abuzer Yakaryilmaz
Classical and quantum realtime alternating automata. CoRR (2014)
Paul C. Bell, Vesa Halava, Mika Hirvensalo
Decision Problems for Probabilistic Finite Automata on Bounded Languages. Fundam. Informaticae 123 (1) (2013)
Paul C. Bell, Mika Hirvensalo, Igor Potapov
Mortality for 2×2 Matrices Is NP-Hard. MFCS (2012)
Nikita Gogin, Mika Hirvensalo
Recurrent Construction of MacWilliams and Chebyshev Matrices. Fundam. Informaticae 116 (1-4) (2012)
Mika Hirvensalo
On probabilistic and quantum reaction systems. Theor. Comput. Sci. 429 (2012)
Henning Bordihn, Rudolf Freund, Mika Hirvensalo, Markus Holzer, Martin Kutrib, Friedrich Otto
Preface. Fundam. Informaticae 112 (2-3) (2011)
Mika Hirvensalo
Quantum Information - A Tutorial. UC (2011)
Mika Hirvensalo
Quantum Automata Theory - A Review. Algebraic Foundations in Computer Science (2011)
Paul Bell, Vesa Halava, Mika Hirvensalo
On the Joint Spectral Radius for Bounded Matrix Languages. RP (2010)
Mika Hirvensalo
Quantum Automata with Open Time Evolution. Int. J. Nat. Comput. Res. 1 (1) (2010)
Mika Hirvensalo
Preface. Theor. Comput. Sci. 410 (20) (2009)
Vesa Halava, Tero Harju, Mika Hirvensalo, Juhani Karhumäki
Post Correspondence Problem for short words. Inf. Process. Lett. 108 (3) (2008)
Mika Hirvensalo
Various Aspects of Finite Quantum Automata. Developments in Language Theory (2008)
Vesa Halava, Tero Harju, Mika Hirvensalo
Undecidability Bounds for Integer Matrices Using Claus Instances. Int. J. Found. Comput. Sci. 18 (5) (2007)
Vesa Halava, Mika Hirvensalo
Improved matrix pair undecidability results. Acta Informatica 44 (3-4) (2007)
Mika Hirvensalo
EPR Paradox and Bell Inequalitites. Bull. EATCS 92 (2007)
Mika Hirvensalo
Improved Undecidability Results on the Emptiness Problem of Probabilistic and Quantum Cut-Point Languages. SOFSEM (1) (2007)
Mika Hirvensalo
Phillip Kaye, Raymond Laflamme and Michele Mosca, An Introduction to Quantum Computing, Oxford University Press (2007) ISBN 019857049X. Comput. Sci. Rev. 1 (1) (2007)
Vesa Halava, Tero Harju, Mika Hirvensalo
Positivity of second order linear recurrent sequences. Discret. Appl. Math. 154 (3) (2006)
Mika Hirvensalo, Jyrki T. Lahtonen
On Self-Dual Bases of the Extensions of the Binary Field. Theory Is Forever (2004)
Mika Hirvensalo, Sebastian Seibert
Lower Bounds for Las Vegas Automata by Information Theory. RAIRO Theor. Informatics Appl. 37 (1) (2003)
Mika Hirvensalo
Universality and Quantum Computing. Bull. EATCS 78 (2002)
Mika Hirvensalo, Juhani Karhumäki
at Base 3 as an Example. MFCS (2002)
Mika Hirvensalo
Computing with quanta - impacts of quantum theory on computation. Theor. Comput. Sci. 287 (1) (2002)
Mika Hirvensalo
Quantum computing - Facts and folklore. Nat. Comput. 1 (1) (2002)
Vesa Halava, Tero Harju, Mika Hirvensalo
Binary (generalized) Post Correspondence Problem. Theor. Comput. Sci. 276 (1-2) (2002)
Vesa Halava, Mika Hirvensalo, Ronald de Wolf
Marked PCP is decidable. Theor. Comput. Sci. 255 (1-2) (2001)
Mika Hirvensalo
Some Open Problems Related to Quantum Computing. Bull. EATCS 74 (2001)
Vesa Halava, Tero Harju, Mika Hirvensalo
Generalized Post Correspondence Problem for Marked Morphisms. Int. J. Algebra Comput. 10 (6) (2000)
Vesa Halava, Tero Harju, Mika Hirvensalo
Generalized PCP Is Decidable for Marked Morphisms. FCT (1999)
Vesa Halava, Mika Hirvensalo, Ronald de Wolf
Decidability and Undecidability of Marked PCP. STACS (1999)
Mika Hirvensalo
An Introduction to Quantum Computing. Bull. EATCS 66 (1998)
Mika Hirvensalo
Copying quantum computer makes NP-complete problems tractable. MCU (2) (1998)
Mika Hirvensalo
The Reversibility in Quantum Computation Theory. Developments in Language Theory (1997)