default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVesa Halava
Person information
- affiliation: University of Turku, Finland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j53]Vesa Halava, Tero Harju
, Dirk Nowotka, Esa Sahla:
Decision Problems on Copying and Shuffling. Fundam. Informaticae 191(3-4): 269-284 (2024)- [j52]Vesa Halava, Jarkko Kari, Tero Laihonen:
Preface. Fundam. Informaticae 191(3-4) (2024) - [j51]Vesa Halava, Stepan Holub:
Binary Generalized PCP for Two Periodic Morphisms is Decidable in Polynomial Time. Int. J. Found. Comput. Sci. 35(1&2): 129-144 (2024) - [j50]Vesa Halava, Reino Niskanen:
On simulating Turing machines with matrix semigroups with integrality tests. Theor. Comput. Sci. 1005: 114637 (2024) - 2023
- [j49]Vesa Halava, Tero Harju, Reino Niskanen, Igor Potapov:
Integer Weighted Automata on Infinite Words. Int. J. Found. Comput. Sci. 34(2&3): 163-182 (2023) - [j48]Olivier Finkel, Vesa Halava, Tero Harju, Esa Sahla:
On bi-infinite and conjugate post correspondence problems. RAIRO Theor. Informatics Appl. 57: 7 (2023) - [i7]Vesa Halava, Tero Harju, Dirk Nowotka, Esa Sahla:
Decision Problems on Copying and Shuffling. CoRR abs/2302.06248 (2023) - 2022
- [i6]Vesa Halava, Tero Harju, Teemu Pirttimäki:
A recursive function coding number theoretic functions. CoRR abs/2203.09311 (2022) - 2021
- [c15]Vesa Halava, Tero Harju, Reino Niskanen, Igor Potapov:
Integer Weighted Automata on Infinite Words. DLT 2021: 167-179 - [i5]Vesa Halava, Tero Harju, Esa Sahla:
The Conjugate Post Correspondence Problem. CoRR abs/2111.04484 (2021) - [i4]Vesa Halava:
Undecidability in Finite Transducers, Defense Systems and Finite Substitutions. CoRR abs/2111.15420 (2021) - 2020
- [j47]Vesa Halava, Tero Harju:
On the Steps of Emil Post: from Normal Systems to the Correspondence Decision Problem. Acta Cybern. 24(4): 613-623 (2020) - [j46]Vesa Halava, Tero Harju, Esa Sahla:
On Shuffling a Word with its Letter-to-Letter Substitution. Fundam. Informaticae 175(1-4): 201-206 (2020)
2010 – 2019
- 2018
- [j45]Vesa Halava, Juhani Karhumäki, Yuri V. Matiyasevich, Mikhail V. Volkov:
Perface. Fundam. Informaticae 162(2-3): i (2018) - [j44]Vesa Halava, Tero Harju, Esa Sahla:
On fixed points of rational transductions. Theor. Comput. Sci. 732: 85-88 (2018) - 2017
- [j43]Vesa Halava, Tero Harju, Esa Sahla:
A New Proof for Undecidability of the Bi-Infinite Post Correspondence Problem. Fundam. Informaticae 154(1-4): 167-176 (2017) - [j42]Vesa Halava, Yuri V. Matiyasevich, Reino Niskanen:
Small Semi-Thue System Universal with Respect to the Termination Problem. Fundam. Informaticae 154(1-4): 177-184 (2017) - [j41]Vesa Halava, Tero Harju, Reino Niskanen, Igor Potapov:
Weighted automata on infinite words in the context of Attacker-Defender games. Inf. Comput. 255: 27-44 (2017) - [j40]Vesa Halava, Tero Harju:
Walks on tilings of polygons. Theor. Comput. Sci. 701: 120-124 (2017) - 2015
- [j39]Mari Ernvall, Vesa Halava, Tero Harju:
On the n-permutation Post Correspondence Problem. Theor. Comput. Sci. 601: 15-20 (2015) - [c14]Vesa Halava, Tero Harju, Reino Niskanen, Igor Potapov:
Weighted Automata on Infinite Words in the Context of Attacker-Defender Games. CiE 2015: 206-215 - [c13]Vesa Halava, Reino Niskanen, Igor Potapov:
On Robot Games of Degree Two. LATA 2015: 224-236 - 2014
- [j38]Vesa Halava, Juhani Karhumäki, Yuri V. Matiyasevich:
Preface. Fundam. Informaticae 132(1) (2014) - [i3]Julien Cassaigne, Vesa Halava, Tero Harju, François Nicolas:
Tighter Undecidability Bounds for Matrix Mortality, Zero-in-the-Corner Problems, and More. CoRR abs/1404.0644 (2014) - [i2]Vesa Halava, Reino Niskanen, Igor Potapov:
On Undecidability of Counter Reachability Games in Dimension One. CoRR abs/1411.4796 (2014) - [i1]Vesa Halava:
Another proof of undecidability for the correspondence decision problem - Had I been Emil Post. CoRR abs/1411.5197 (2014) - 2013
- [j37]Vesa Halava, Tero Harju:
New proof for the undecidability of the circular PCP. Acta Informatica 50(5-6): 331-341 (2013) - [j36]Paul C. Bell, Vesa Halava, Mika Hirvensalo:
Decision Problems for Probabilistic Finite Automata on Bounded Languages. Fundam. Informaticae 123(1): 1-14 (2013) - [c12]Vesa Halava:
Deterministic Semi-Thue Systems and Variants of Post Correspondence Problem. WORDS 2013: 4-13 - 2012
- [j35]Vesa Halava, Juhani Karhumäki, Dirk Nowotka, Grzegorz Rozenberg:
Words, Graphs, Automata, and Languages; Special Issue Honoring the 60th Birthday of Professor Tero Harju. Fundam. Informaticae 116(1-4) (2012) - 2011
- [j34]Vesa Halava, Stepan Holub:
Reduction Tree of the Binary Generalized Post Correspondence Problem. Int. J. Found. Comput. Sci. 22(2): 473-490 (2011) - [c11]Vesa Halava, Tero Harju, Tomi Kärki:
A new proof for the decidability of D0L ultimate periodicity. WORDS 2011: 147-151 - 2010
- [j33]Vesa Halava, Tero Harju, Tomi Kärki:
On the number of squares in partial words. RAIRO Theor. Informatics Appl. 44(1): 125-138 (2010) - [c10]Vesa Halava, Tero Harju, Tomi Kärki, Michel Rigo:
On the Periodicity of Morphic Words. Developments in Language Theory 2010: 209-217 - [c9]Paul Bell, Vesa Halava, Mika Hirvensalo:
On the Joint Spectral Radius for Bounded Matrix Languages. RP 2010: 91-103
2000 – 2009
- 2009
- [j32]Vesa Halava, Igor Potapov:
Preface. Int. J. Found. Comput. Sci. 20(5): 775-777 (2009) - [j31]Vesa Halava, Tero Harju, Tomi Kärki:
The theorem of Fine and Wilf for relational periods. RAIRO Theor. Informatics Appl. 43(2): 209-220 (2009) - [j30]Vesa Halava, Tero Harju, Tomi Kärki, Patrice Séébold:
Overlap-freeness in infinite partial words. Theor. Comput. Sci. 410(8-10): 943-948 (2009) - [j29]Vesa Halava, Jarkko Kari, Yuri V. Matiyasevich:
On post correspondence problem for letter monotonic languages. Theor. Comput. Sci. 410(30-32): 2957-2960 (2009) - 2008
- [j28]Tomi Kärki, Tero Harju, Vesa Halava:
Interaction Properties of Relational Periods. Discret. Math. Theor. Comput. Sci. 10(1) (2008) - [j27]Paul Bell, Vesa Halava, Tero Harju, Juhani Karhumäki, Igor Potapov:
Matrix Equations and Hilbert's Tenth Problem. Int. J. Algebra Comput. 18(8): 1231-1241 (2008) - [j26]Vesa Halava, Igor Potapov:
Preface. Int. J. Found. Comput. Sci. 19(4): 915-917 (2008) - [j25]Vesa Halava, Tero Harju, Mika Hirvensalo, Juhani Karhumäki:
Post Correspondence Problem for short words. Inf. Process. Lett. 108(3): 115-118 (2008) - [j24]Vesa Halava, Tero Harju, Tomi Kärki:
Square-free partial words. Inf. Process. Lett. 108(5): 290-292 (2008) - [c8]Vesa Halava, Igor Potapov:
Preface. RP 2008: 1-2 - [e1]Vesa Halava, Igor Potapov:
Proceedings of the Second Workshop on Reachability Problems in Computational Models, RP 2008, Liverpool, UK, September 15-17, 2008. Electronic Notes in Theoretical Computer Science 223, Elsevier 2008 [contents] - 2007
- [j23]Vesa Halava, Mika Hirvensalo:
Improved matrix pair undecidability results. Acta Informatica 44(3-4): 191-205 (2007) - [j22]Vesa Halava, Tero Harju, Mika Hirvensalo:
Undecidability Bounds for Integer Matrices Using Claus Instances. Int. J. Found. Comput. Sci. 18(5): 931-948 (2007) - [j21]Vesa Halava, Tero Harju, Juhani Karhumäki:
The Structure of Infinite Solutions of Marked and Binary Post Correspondence Problems. Theory Comput. Syst. 40(1): 43-54 (2007) - [j20]Vesa Halava, Tero Harju, Juhani Karhumäki, Michel Latteux:
Extension of the decidability of the marked PCP to instances with unique blocks. Theor. Comput. Sci. 380(3): 355-362 (2007) - [j19]Vesa Halava, Tero Harju, Tomi Kärki:
Relational codes of words. Theor. Comput. Sci. 389(1-2): 237-249 (2007) - 2006
- [j18]Vesa Halava, Tero Harju, Mika Hirvensalo:
Positivity of second order linear recurrent sequences. Discret. Appl. Math. 154(3): 447-451 (2006) - [j17]Vesa Halava, Tero Harju, Juhani Karhumäki:
Undecidability in omega-Regular Languages. Fundam. Informaticae 73(1-2): 119-125 (2006) - [j16]Vesa Halava, Tero Harju:
Undecidability of infinite post correspondence problem for instances of Size 9. RAIRO Theor. Informatics Appl. 40(4): 551-557 (2006) - 2005
- [j15]Vesa Halava, Tero Harju, Michel Latteux:
Representation of Regular Languages by Equality Sets. Bull. EATCS 86: 224-228 (2005) - [j14]Vesa Halava, Tero Harju, Michel Latteux:
Equality sets of prefix morphisms and regular star languages. Inf. Process. Lett. 94(4): 151-154 (2005) - [j13]Vesa Halava, Tero Harju, Hendrik Jan Hoogeboom, Michel Latteux:
Equality sets for recursively enumerable languages. RAIRO Theor. Informatics Appl. 39(4): 661-675 (2005) - 2004
- [j12]Vesa Halava, Tero Harju:
Undecidability in matrices over Laurent polynomials. Adv. Appl. Math. 33(4): 747-752 (2004) - [j11]Vesa Halava, Tero Harju, Hendrik Jan Hoogeboom, Michel Latteux:
Valence Languages Generated by Equality Sets. J. Autom. Lang. Comb. 9(4): 399-406 (2004) - [c7]Vesa Halava:
Integer Weighted Finite Automata, Matrices, and Formal Power Series over Laurent Polynomials. Theory Is Forever 2004: 81-88 - 2003
- [j10]Vesa Halava, Tero Harju, Juhani Karhumäki:
Decidability of the binary infinite Post Correspondence Problem. Discret. Appl. Math. 130(3): 521-526 (2003) - [c6]Vesa Halava, Tero Harju, Hendrik Jan Hoogeboom, Michel Latteux:
Languages Defined by Generalized Equality Sets. FCT 2003: 355-363 - 2002
- [j9]Vesa Halava, Tero Harju, Mika Hirvensalo:
Binary (generalized) Post Correspondence Problem. Theor. Comput. Sci. 276(1-2): 183-204 (2002) - [c5]Vesa Halava, Tero Harju:
Infinite Solutions of Marked Post Correspondence Problem. Formal and Natural Computing 2002: 57-68 - 2001
- [j8]Vesa Halava, Tero Harju:
Some New Results on Post Correspondence Problem and Its Modifications. Bull. EATCS 73: 131-141 (2001) - [j7]Vesa Halava, Tero Harju:
Mortality in Matrix Semigroups. Am. Math. Mon. 108(7): 649-653 (2001) - [j6]Vesa Halava, Mika Hirvensalo, Ronald de Wolf:
Marked PCP is decidable. Theor. Comput. Sci. 255(1-2): 193-204 (2001) - [c4]Vesa Halava, Tero Harju:
An Undecidability Result Concerning Periodic Morphisms. Developments in Language Theory 2001: 304-310 - 2000
- [j5]Vesa Halava, Tero Harju, Mika Hirvensalo:
Generalized Post Correspondence Problem for Marked Morphisms. Int. J. Algebra Comput. 10(6): 757-772 (2000) - [j4]Vesa Halava, Tero Harju, Lucian Ilie:
Periods and Binary Words. J. Comb. Theory A 89(2): 298-303 (2000)
1990 – 1999
- 1999
- [j3]Vesa Halava, Tero Harju:
Undecidability in Integer Weighted Finite Automata. Fundam. Informaticae 38(1-2): 189-200 (1999) - [j2]Vesa Halava, Tero Harju:
Undecidability of the equivalence of finite substitutions on regular language. RAIRO Theor. Informatics Appl. 33(2): 117-124 (1999) - [c3]Vesa Halava, Tero Harju:
Languages Accepted by Integer Weighted Finite Automata. Jewels are Forever 1999: 123-134 - [c2]Vesa Halava, Tero Harju, Mika Hirvensalo:
Generalized PCP Is Decidable for Marked Morphisms. FCT 1999: 304-315 - [c1]Vesa Halava, Mika Hirvensalo, Ronald de Wolf:
Decidability and Undecidability of Marked PCP. STACS 1999: 207-216 - 1997
- [j1]Vesa Halava, Tero Harju, Lucian Ilie:
On a Geometric Problem of Zigzags. Inf. Process. Lett. 62(1): 1-4 (1997)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:06 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
