default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTero Harju
Person information
- affiliation: University of Turku, Finland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j123]Vesa Halava, Tero Harju
, Dirk Nowotka, Esa Sahla:
Decision Problems on Copying and Shuffling. Fundam. Informaticae 191(3-4): 269-284 (2024)- [j122]Tero Harju:
A Note on Squares in Binary Words. Int. J. Found. Comput. Sci. 35(1&2): 101-106 (2024) - [j121]Tero Harju:
A simple undecidable problem for free groups. Theor. Comput. Sci. 1003: 114629 (2024) - 2023
- [j120]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) - [j119]Olivier Finkel, Vesa Halava, Tero Harju, Esa Sahla:
On bi-infinite and conjugate post correspondence problems. RAIRO Theor. Informatics Appl. 57: 7 (2023) - [i13]Vesa Halava, Tero Harju, Dirk Nowotka, Esa Sahla:
Decision Problems on Copying and Shuffling. CoRR abs/2302.06248 (2023) - 2022
- [j118]Tero Harju:
Critical factorisation in square-free words. RAIRO Theor. Informatics Appl. 56: 3 (2022) - [j117]Golnaz Badkobeh, Tero Harju, Pascal Ochem, Matthieu Rosenfeld:
Avoiding square-free words on free groups. Theor. Comput. Sci. 922: 206-217 (2022) - [i12]Vesa Halava, Tero Harju, Teemu Pirttimäki:
A recursive function coding number theoretic functions. CoRR abs/2203.09311 (2022) - 2021
- [j116]Tero Harju:
Disposability in square-free words. Theor. Comput. Sci. 862: 155-159 (2021) - [c46]Vesa Halava, Tero Harju, Reino Niskanen, Igor Potapov:
Integer Weighted Automata on Infinite Words. DLT 2021: 167-179 - [p4]Tero Harju, Juhani Karhumäki:
Finite transducers and rational transductions. Handbook of Automata Theory (I.) 2021: 79-111 - [i11]Tero Harju:
Critical factorisation in square-free words. CoRR abs/2107.09421 (2021) - [i10]Tero Harju:
A Note on Squares in Binary Words. CoRR abs/2108.04572 (2021) - [i9]Vesa Halava, Tero Harju, Esa Sahla:
The Conjugate Post Correspondence Problem. CoRR abs/2111.04484 (2021) - 2020
- [j115]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) - [j114]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
- 2019
- [j113]Tero Harju:
On square-free arithmetic progressions in infinite words. Theor. Comput. Sci. 770: 95-100 (2019) - [j112]James D. Currie, Tero Harju, Pascal Ochem, Narad Rampersad:
Some further results on squarefree arithmetic progressions in infinite words. Theor. Comput. Sci. 799: 140-148 (2019) - [i8]James D. Currie, Tero Harju, Pascal Ochem, Narad Rampersad:
Some further results on squarefree arithmetic progressions in infinite words. CoRR abs/1901.06351 (2019) - 2018
- [j111]Vesa Halava, Tero Harju, Esa Sahla:
On fixed points of rational transductions. Theor. Comput. Sci. 732: 85-88 (2018) - 2017
- [j110]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) - [j109]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) - [j108]Vesa Halava, Tero Harju:
Walks on tilings of polygons. Theor. Comput. Sci. 701: 120-124 (2017) - 2016
- [j107]Émilie Charlier, Tero Harju, Svetlana Puzynina, Luca Q. Zamboni:
Abelian bordered factors and periodicity. Eur. J. Comb. 51: 407-418 (2016) - 2015
- [j106]Tero Harju, Mari Huova, Luca Q. Zamboni:
On generating binary words palindromically. J. Comb. Theory A 129: 142-159 (2015) - [j105]Tero Harju, Mike Müller:
A note on short palindromes in square-free words. Theor. Comput. Sci. 562: 658-659 (2015) - [j104]Mari Ernvall, Vesa Halava, Tero Harju:
On the n-permutation Post Correspondence Problem. Theor. Comput. Sci. 601: 15-20 (2015) - [j103]Tero Harju, Mike Müller:
Square-free shuffles of words. Theor. Comput. Sci. 601: 29-38 (2015) - [c45]Vesa Halava, Tero Harju, Reino Niskanen, Igor Potapov:
Weighted Automata on Infinite Words in the Context of Attacker-Defender Games. CiE 2015: 206-215 - [i7]Emilie Charlier, Tero Harju, Svetlana Puzynina, Luca Q. Zamboni:
Abelian bordered factors and periodicity. CoRR abs/1501.07464 (2015) - 2014
- [c44]Tero Harju, Tomi Kärki:
Minimal Similarity Relations for Square-Free Words. Discrete Mathematics and Computer Science 2014: 193-200 - [i6]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) - 2013
- [j102]Vesa Halava, Tero Harju:
New proof for the undecidability of the circular PCP. Acta Informatica 50(5-6): 331-341 (2013) - [j101]Emilie Charlier, Michael Domaratzki, Tero Harju, Jeffrey O. Shallit:
Composition and orbits of language operations: finiteness and upper bounds. Int. J. Comput. Math. 90(6): 1171-1196 (2013) - [c43]Tero Harju:
A Note on Square-Free Shuffles of Words. WORDS 2013: 154-160 - [i5]Tero Harju, Mari Huova, Luca Q. Zamboni:
On Generating Binary Words Palindromically. CoRR abs/1309.1886 (2013) - [i4]Tero Harju, Mike Müller:
Square-Free Shuffles of Words. CoRR abs/1309.2137 (2013) - 2012
- [j100]Tero Harju:
Square-free words obtained from prefixes by permutations. Theor. Comput. Sci. 429: 128-133 (2012) - [j99]Sepinoud Azimi, Tero Harju, Miika Langille, Ion Petre:
Simple gene assembly as a rewriting of directed overlap-inclusion graphs. Theor. Comput. Sci. 454: 30-37 (2012) - [j98]Robert Brijder, Tero Harju, Hendrik Jan Hoogeboom:
Pivots, determinants, and perfect matchings of graphs. Theor. Comput. Sci. 454: 64-71 (2012) - [p3]Robert Brijder, Mark Daley, Tero Harju, Natasa Jonoska, Ion Petre, Grzegorz Rozenberg:
Computational Nature of Gene Assembly in Ciliates. Handbook of Natural Computing 2012: 1233-1280 - 2011
- [j97]Tero Harju, Tomi Kärki, Dirk Nowotka:
The Number of Positions Starting a Square in Binary Words. Electron. J. Comb. 18(1) (2011) - [j96]Sepinoud Azimi, Tero Harju, Miika Langille, Ion Petre, Vladimir Rogojin:
Directed Overlap-inclusion Graphs as Representations of Ciliate Genes. Fundam. Informaticae 110(1-4): 29-44 (2011) - [j95]Tero Harju, Tomi Kärki:
On the number of frames in binary words. Theor. Comput. Sci. 412(39): 5276-5284 (2011) - [c42]Emilie Charlier, Michael Domaratzki, Tero Harju, Jeffrey O. Shallit:
Finite Orbits of Language Operations. LATA 2011: 204-215 - [c41]Vesa Halava, Tero Harju, Tomi Kärki:
A new proof for the decidability of D0L ultimate periodicity. WORDS 2011: 147-151 - [i3]Emilie Charlier, Michael Domaratzki, Tero Harju, Jeffrey O. Shallit:
Finite Orbits of Language Operations. CoRR abs/1101.1667 (2011) - [i2]Tero Harju:
Square-free Walks on Labelled Graphs. CoRR abs/1106.4106 (2011) - 2010
- [j94]Tero Harju, Dirk Nowotka:
Cyclically repetition-free words on small alphabets. Inf. Process. Lett. 110(14-15): 591-595 (2010) - [j93]Vesa Halava, Tero Harju, Tomi Kärki:
On the number of squares in partial words. RAIRO Theor. Informatics Appl. 44(1): 125-138 (2010) - [c40]Vesa Halava, Tero Harju, Tomi Kärki, Michel Rigo:
On the Periodicity of Morphic Words. Developments in Language Theory 2010: 209-217
2000 – 2009
- 2009
- [j92]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) - [j91]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) - [c39]Jurriaan Hage, Tero Harju:
On Involutions Arising from Graphs. Algorithmic Bioprocesses 2009: 623-630 - [c38]Tero Harju:
Post Correspondence Problem and Small Dimensional Matrices. Developments in Language Theory 2009: 39-46 - 2008
- [j90]Tero Harju, Dirk Nowotka:
Bordered Conjugates of Words over Large Alphabets. Electron. J. Comb. 15(1) (2008) - [j89]Tero Harju, Ion Petre, Vladimir Rogojin, Grzegorz Rozenberg:
Patterns of simple gene assembly in ciliates. Discret. Appl. Math. 156(14): 2581-2597 (2008) - [j88]Tero Harju, Chang Li, Ion Petre:
Graph theoretic approach to parallel gene assembly. Discret. Appl. Math. 156(18): 3416-3429 (2008) - [j87]Jean-Pierre Duval, Tero Harju, Dirk Nowotka:
Unbordered factors and Lyndon words. Discret. Math. 308(11): 2261-2264 (2008) - [j86]Tomi Kärki, Tero Harju, Vesa Halava:
Interaction Properties of Relational Periods. Discret. Math. Theor. Comput. Sci. 10(1) (2008) - [j85]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) - [j84]Tero Harju, Juhani Karhumäki:
Preface. Int. J. Found. Comput. Sci. 19(3): 495-496 (2008) - [j83]Vesa Halava, Tero Harju, Mika Hirvensalo, Juhani Karhumäki:
Post Correspondence Problem for short words. Inf. Process. Lett. 108(3): 115-118 (2008) - [j82]Vesa Halava, Tero Harju, Tomi Kärki:
Square-free partial words. Inf. Process. Lett. 108(5): 290-292 (2008) - [j81]Jean Berstel, Tero Harju, Juhani Karhumäki:
Preface. RAIRO Theor. Informatics Appl. 42(4): 657 (2008) - [j80]Tero Harju, Chang Li, Ion Petre:
Parallel complexity of signed graphs for gene assembly in ciliates. Soft Comput. 12(8): 731-737 (2008) - 2007
- [j79]Andrzej Ehrenfeucht, Tero Harju, Grzegorz Rozenberg:
Finite metrics in switching classes. Discret. Appl. Math. 155(1): 68-73 (2007) - [j78]Jurriaan Hage, Tero Harju:
Towards a characterization of bipartite switching classes by means of forbidden subgraphs. Discuss. Math. Graph Theory 27(3): 471-483 (2007) - [j77]Vesa Halava, Tero Harju, Mika Hirvensalo:
Undecidability Bounds for Integer Matrices Using Claus Instances. Int. J. Found. Comput. Sci. 18(5): 931-948 (2007) - [j76]Tero Harju, Dirk Nowotka:
Periodicity and unbordered words: A proof of the extended duval conjecture. J. ACM 54(4): 20 (2007) - [j75]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) - [j74]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) - [j73]Vesa Halava, Tero Harju, Tomi Kärki:
Relational codes of words. Theor. Comput. Sci. 389(1-2): 237-249 (2007) - [e1]Tero Harju, Juhani Karhumäki, Arto Lepistö:
Developments in Language Theory, 11th International Conference, DLT 2007, Turku, Finland, July 3-6, 2007, Proceedings. Lecture Notes in Computer Science 4588, Springer 2007, ISBN 978-3-540-73207-5 [contents] - 2006
- [j72]Andrzej Ehrenfeucht, Tero Harju, Grzegorz Rozenberg:
Embedding linear orders in grids. Acta Informatica 42(6-7): 419-428 (2006) - [j71]Tero Harju, Dirk Nowotka:
Periods in Extensions of Words. Acta Informatica 43(3): 165-171 (2006) - [j70]Vesa Halava, Tero Harju, Mika Hirvensalo:
Positivity of second order linear recurrent sequences. Discret. Appl. Math. 154(3): 447-451 (2006) - [j69]Tero Harju, Dirk Nowotka:
Binary Words with Few Squares. Bull. EATCS 89: 164-166 (2006) - [j68]Vesa Halava, Tero Harju, Juhani Karhumäki:
Undecidability in omega-Regular Languages. Fundam. Informaticae 73(1-2): 119-125 (2006) - [j67]Andrzej Ehrenfeucht, Jurriaan Hage, Tero Harju, Grzegorz Rozenberg:
The Embedding Problem for Switching Classes of Graphs. Fundam. Informaticae 74(1): 115-134 (2006) - [j66]Vesa Halava, Tero Harju:
Undecidability of infinite post correspondence problem for instances of Size 9. RAIRO Theor. Informatics Appl. 40(4): 551-557 (2006) - [j65]Tero Harju, Chang Li, Ion Petre, Grzegorz Rozenberg:
Parallelism in Gene Assembly. Nat. Comput. 5(2): 203-223 (2006) - [j64]Tero Harju, Dirk Nowotka:
On unique factorizations of primitive words. Theor. Comput. Sci. 356(1-2): 186-189 (2006) - [c37]Tero Harju, Chang Li, Ion Petre, Grzegorz Rozenberg:
Complexity Measures for Gene Assembly. KDECB 2006: 42-60 - [c36]Tero Harju, Ion Petre, Grzegorz Rozenberg:
Modelling Simple Operations for Gene Assembly. Nanotechnology: Science and Computation 2006: 361-373 - 2005
- [j63]Vesa Halava, Tero Harju, Michel Latteux:
Representation of Regular Languages by Equality Sets. Bull. EATCS 86: 224-228 (2005) - [j62]Vesa Halava, Tero Harju, Michel Latteux:
Equality sets of prefix morphisms and regular star languages. Inf. Process. Lett. 94(4): 151-154 (2005) - [j61]Vesa Halava, Tero Harju, Hendrik Jan Hoogeboom, Michel Latteux:
Equality sets for recursively enumerable languages. RAIRO Theor. Informatics Appl. 39(4): 661-675 (2005) - [j60]Tero Harju, Dirk Nowotka:
On the equation in a free semigroup. Theor. Comput. Sci. 330(1): 117-121 (2005) - [j59]Tero Harju, Juhani Karhumäki, Antonio Restivo:
Preface. Theor. Comput. Sci. 339(1): 1-2 (2005) - [j58]Tero Harju, Dirk Nowotka:
Counting bordered and primitive words with a fixed weight. Theor. Comput. Sci. 340(1): 273-279 (2005) - [j57]Tero Harju, Arto Lepistö, Dirk Nowotka:
A characterization of periodicity of bi-infinite words. Theor. Comput. Sci. 347(1-2): 419-422 (2005) - [c35]Tero Harju:
Combinatorial Models of Gene Assembly. CiE 2005: 188-195 - [c34]Tero Harju, Ion Petre, Vladimir Rogojin, Grzegorz Rozenberg:
Simple Operations for Gene Assembly. DNA 2005: 96-111 - [c33]Tero Harju:
Characterizations of Regularity. FSMNLP 2005: 1-8 - 2004
- [j56]Vesa Halava, Tero Harju:
Undecidability in matrices over Laurent polynomials. Adv. Appl. Math. 33(4): 747-752 (2004) - [j55]Andrzej Ehrenfeucht, Tero Harju, Grzegorz Rozenberg:
Transitivity of local complementation and switching on graphs. Discret. Math. 278(1-3): 45-60 (2004) - [j54]Tero Harju, Ion Petre, Grzegorz Rozenberg:
Gene Assembly in Celiates. Part I. Molecular Operations (Column: Natural Computing). Bull. EATCS 82: 227-241 (2004) - [j53]Tero Harju, Dirk Nowotka:
Minimal Duval Extensions. Int. J. Found. Comput. Sci. 15(2): 349-354 (2004) - [j52]Vesa Halava, Tero Harju, Hendrik Jan Hoogeboom, Michel Latteux:
Valence Languages Generated by Equality Sets. J. Autom. Lang. Comb. 9(4): 399-406 (2004) - [j51]Tero Harju, Dirk Nowotka:
Border correlation of binary words. J. Comb. Theory A 108(2): 331-341 (2004) - [j50]Jurriaan Hage, Tero Harju:
A Characterization of Acyclic Switching Classes of Graphs Using Forbidden Subgraphs. SIAM J. Discret. Math. 18(1): 159-176 (2004) - [j49]Tero Harju, Juhani Karhumäki:
Many aspects of defect theorems. Theor. Comput. Sci. 324(1): 35-54 (2004) - [c32]Tero Harju, Ion Petre, Grzegorz Rozenberg:
Two Models for Gene Assembly in Ciliates. Theory Is Forever 2004: 89-101 - [c31]Tero Harju, Ion Petre, Grzegorz Rozenberg:
Formal Properties of Gene Assembly: Equivalence Problem for Overlap Graphs. Aspects of Molecular Computing 2004: 202-212 - [c30]Tero Harju, Chang Li, Ion Petre, Grzegorz Rozenberg:
Parallelism in Gene Assembly. DNA 2004: 138-148 - [c29]Tero Harju, Maurice Margenstern:
Splicing Systems for Universal Turing Machines. DNA 2004: 149-158 - [c28]Andrzej Ehrenfeucht, Jurriaan Hage, Tero Harju, Grzegorz Rozenberg:
Embedding in Switching Classes with Skew Gains. ICGT 2004: 257-270 - [c27]Tero Harju, Ion Petre, Grzegorz Rozenberg:
Tutorial on DNA Computing and Graph Transformation. ICGT 2004: 434-436 - [c26]Tero Harju, Dirk Nowotka:
Periodicity and Unbordered Words: A Proof of Duval?s Conjecture. STACS 2004: 294-304 - 2003
- [j48]Vesa Halava, Tero Harju, Juhani Karhumäki:
Decidability of the binary infinite Post Correspondence Problem. Discret. Appl. Math. 130(3): 521-526 (2003) - [j47]Tero Harju, Dirk Nowotka:
Periodicity and Unbordered Segments of Words. Bull. EATCS 80: 162-167 (2003) - [j46]Tero Harju, Ion Petre, Grzegorz Rozenberg:
Gene Assembly in Ciliates Part I. Molecular Operations. Bull. EATCS 81: 236-249 (2003) - [j45]Jurriaan Hage, Tero Harju, Emo Welzl:
Euler Graphs, Triangle-Free Graphs and Bipartite Graphs in Switching Classes. Fundam. Informaticae 58(1): 23-37 (2003) - [j44]Andrzej Ehrenfeucht, Tero Harju, Ion Petre, David M. Prescott, Grzegorz Rozenberg:
Formal systems for gene assembly in ciliates. Theor. Comput. Sci. 292(1): 199-219 (2003) - [j43]Tero Harju, Dirk Nowotka:
On the independence of equations in three variables. Theor. Comput. Sci. 307(1): 139-172 (2003) - [c25]Tero Harju, Dirk Nowotka:
About Duval's Conjecture. Developments in Language Theory 2003: 316-324 - [c24]Vesa Halava, Tero Harju, Hendrik Jan Hoogeboom, Michel Latteux:
Languages Defined by Generalized Equality Sets. FCT 2003: 355-363 - [i1]Tero Harju, Dirk Nowotka:
Periodicity and Unbordered Words: A Proof of the Extended Duval Conjecture. CoRR cs.DM/0305039 (2003) - 2002
- [j42]Tero Harju, Dirk Nowotka:
Density of Critical Factorizations. RAIRO Theor. Informatics Appl. 36(3): 315-327 (2002) - [j41]Tero Harju, Oscar H. Ibarra, Juhani Karhumäki, Arto Salomaa:
Some Decision Problems Concerning Semilinearity and Commutation. J. Comput. Syst. Sci. 65(2): 278-294 (2002) - [j40]Andrzej Ehrenfeucht, Tero Harju, Ion Petre, Grzegorz Rozenberg:
Characterizing the Micronuclear Gene Patterns in Ciliates. Theory Comput. Syst. 35(5): 501-519 (2002) - [j39]Vesa Halava, Tero Harju, Mika Hirvensalo:
Binary (generalized) Post Correspondence Problem. Theor. Comput. Sci. 276(1-2): 183-204 (2002) - [j38]Andrzej Ehrenfeucht, Tero Harju, Grzegorz Rozenberg:
Gene assembly through cyclic graph decomposition. Theor. Comput. Sci. 281(1-2): 325-349 (2002) - [c23]Vesa Halava, Tero Harju:
Infinite Solutions of Marked Post Correspondence Problem. Formal and Natural Computing 2002: 57-68 - [c22]Tero Harju, Grzegorz Rozenberg:
Computational Processes in Living Cells: Gene Assembly in Ciliates. Developments in Language Theory 2002: 1-20 - [c21]Jurriaan Hage, Tero Harju, Emo Welzl:
Euler Graphs, Triangle-Free Graphs and Bipartite Graphs in Switching Classes. ICGT 2002: 148-160 - [c20]Tero Harju, Ion Petre, Grzegorz Rozenberg:
Tutorial on DNA Computing and Graph Transformation - Computational Nature of Gene Assembly in Ciliates. ICGT 2002: 430-434 - 2001
- [j37]Vesa Halava, Tero Harju:
Some New Results on Post Correspondence Problem and Its Modifications. Bull. EATCS 73: 131-141 (2001) - [j36]Vesa Halava, Tero Harju:
Mortality in Matrix Semigroups. Am. Math. Mon. 108(7): 649-653 (2001) - [c19]Tero Harju, Lucian Ilie:
Forbidden subsequences and permutations sortable on two parallel stacks. Where Mathematics, Computer Science, Linguistics and Biology Meet 2001: 267-275 - [c18]Tero Harju:
Decision Questions on Integer Matrices. Developments in Language Theory 2001: 57-68 - [c17]Vesa Halava, Tero Harju:
An Undecidability Result Concerning Periodic Morphisms. Developments in Language Theory 2001: 304-310 - [c16]Andrzej Ehrenfeucht, Tero Harju, Ion Petre, Grzegorz Rozenberg:
Patterns of Micronuclear Genes in ciliates. DNA 2001: 279-289 - [c15]Tero Harju, Oscar H. Ibarra, Juhani Karhumäki, Arto Salomaa:
Decision Questions Concerning Semilinearity, Morphisms, and Commutation of Languages. ICALP 2001: 579-590 - 2000
- [j35]Jurriaan Hage, Tero Harju:
The size of switching classes with skew gains. Discret. Math. 215: 81-92 (2000) - [j34]Vesa Halava, Tero Harju, Mika Hirvensalo:
Generalized Post Correspondence Problem for Marked Morphisms. Int. J. Algebra Comput. 10(6): 757-772 (2000) - [j33]Andrzej Ehrenfeucht, Jurriaan Hage, Tero Harju, Grzegorz Rozenberg:
Pancyclicity in switching classes. Inf. Process. Lett. 73(5-6): 153-156 (2000) - [j32]Vesa Halava, Tero Harju, Lucian Ilie:
Periods and Binary Words. J. Comb. Theory A 89(2): 298-303 (2000)
1990 – 1999
- 1999
- [b1]Andrzej Ehrenfeucht, Tero Harju, Grzegorz Rozenberg:
The Theory of 2-Structures - A Framework for Decomposition and Transformation of Graphs. World Scientific 1999, ISBN 978-981-02-4042-4, pp. I-XVI, 1-290 - [j31]Vesa Halava, Tero Harju:
Undecidability in Integer Weighted Finite Automata. Fundam. Informaticae 38(1-2): 189-200 (1999) - [j30]Julien Cassaigne, Tero Harju, Juhani Karhumäki:
On the Undecidability of Freeness of Matrix Semigroups. Int. J. Algebra Comput. 9(3-4): 295-306 (1999) - [j29]Vesa Halava, Tero Harju:
Undecidability of the equivalence of finite substitutions on regular language. RAIRO Theor. Informatics Appl. 33(2): 117-124 (1999) - [c14]Vesa Halava, Tero Harju:
Languages Accepted by Integer Weighted Finite Automata. Jewels are Forever 1999: 123-134 - [c13]Vesa Halava, Tero Harju, Mika Hirvensalo:
Generalized PCP Is Decidable for Marked Morphisms. FCT 1999: 304-315 - 1998
- [j28]Andrzej Ehrenfeucht, Tero Harju, Paulien ten Pas, Grzegorz Rozenberg:
Permutations, parenthesis words, and Schröder numbers. Discret. Math. 190(1-3): 259-264 (1998) - [j27]Jurriaan Hage, Tero Harju:
Acyclicity of Switching Classes. Eur. J. Comb. 19(3): 321-327 (1998) - [j26]Tero Harju, Lucian Ilie:
On Quasi Orders of Words and the Confluence Property. Theor. Comput. Sci. 200(1-2): 205-224 (1998) - [c12]Tero Harju, Alexandru Mateescu, Arto Salomaa:
Shuffle on Trajectories: The Schützenberger Product and Related Operations. MFCS 1998: 503-511 - [c11]Andrzej Ehrenfeucht, Jurriaan Hage, Tero Harju, Grzegorz Rozenberg:
Complexity Issues in Switching of Graphs. TAGT 1998: 59-70 - 1997
- [j25]Tero Harju, Juhani Karhumäki, Wojciech Plandowski:
Compactness of Systems of Equations in Semigroups. Int. J. Algebra Comput. 7(4): 457-470 (1997) - [j24]Vesa Halava, Tero Harju, Lucian Ilie:
On a Geometric Problem of Zigzags. Inf. Process. Lett. 62(1): 1-4 (1997) - [j23]Tero Harju, Lucian Ilie:
Languages Obtained from Infinite Words. RAIRO Theor. Informatics Appl. 31(5): 445-455 (1997) - [j22]Andrzej Ehrenfeucht, Tero Harju, Grzegorz Rozenberg:
Invariants of Inversive 2-Structures on Groups of Labels. Math. Struct. Comput. Sci. 7(4): 303-327 (1997) - [j21]Christian Choffrut, Tero Harju, Juhani Karhumäki:
A Note on Decidability Questions on Presentations of Word Semigroups. Theor. Comput. Sci. 183(1): 83-92 (1997) - [c10]Tero Harju, Juhani Karhumäki, Mario Petrich:
Compactness of Systems of Equations on Completely Regular Semigroups. Structures in Logic and Computer Science 1997: 268-280 - [p2]Andrzej Ehrenfeucht, Tero Harju, Grzegorz Rozenberg:
2-Structures - A Framework For Decomposition And Transformation Of Graphs. Handbook of Graph Grammars 1997: 401-478 - [p1]Tero Harju, Juhani Karhumäki:
Morphisms. Handbook of Formal Languages (1) 1997: 439-510 - 1996
- [j20]Joost Engelfriet, Tero Harju, Andrzej Proskurowski, Grzegorz Rozenberg:
Characterization and Complexity of Uniformly Non Primitive Labeled 2-Structures. Theor. Comput. Sci. 154(2): 247-282 (1996) - [j19]Tero Harju, Marjo Lipponen, Alexandru Mateescu:
Flatwords and Post Correspondence Problem. Theor. Comput. Sci. 161(1&2): 93-108 (1996) - [c9]Tero Harju, Juhani Karhumäki, Daniel Krob:
Remarks on Generalized Post Correspondence Problem. STACS 1996: 39-48 - 1995
- [c8]Andrzej Ehrenfeucht, Tero Harju, Grzegorz Rozenberg:
Theory of 2-Structures. ICALP 1995: 1-14 - [c7]Tero Harju, Juhani Karhumäki, Wojciech Plandowski:
Compactness of Systems of Equations in Semigroups. ICALP 1995: 444-454 - 1994
- [j18]Andrzej Ehrenfeucht, Tero Harju, Grzegorz Rozenberg:
Incremental construction of 2-structures. Discret. Math. 128(1-3): 113-141 (1994) - [j17]Tero Harju, Grzegorz Rozenberg:
Reductions for Primitive 2-Structures. Fundam. Informaticae 20(1/2/3): 133-144 (1994) - [j16]Tero Harju, N. W. Keesmaat, H. C. M. Kleijn:
The Intersection Problem for Alphabetic Vector Monoids. RAIRO Theor. Informatics Appl. 28(3-4): 295-301 (1994) - [j15]Tero Harju, H. C. M. Kleijn, Michel Latteux, Alain Terlutte:
Representation of Rational Functions with Prefix and Suffix Codings. Theor. Comput. Sci. 134(2): 403-413 (1994) - [c6]Tero Harju, Hendrik Jan Hoogeboom, H. C. M. Kleijn:
Identities and Transductions. Results and Trends in Theoretical Computer Science 1994: 140-144 - [c5]Tero Harju, Grzegorz Rozenberg:
Decompostion of Infinite Labeled 2-Structures. Results and Trends in Theoretical Computer Science 1994: 145-158 - [c4]Andrzej Ehrenfeucht, Tero Harju, Grzegorz Rozenberg:
Group Based Graph Transformations and Hierarchical Representations of Graphs. TAGT 1994: 502-520 - 1993
- [j14]Tero Harju, H. C. M. Kleijn:
Morphisms and rational tranducers. Bull. EATCS 51: 168-180 (1993) - 1992
- [j13]Tero Harju, H. C. M. Kleijn, Michel Latteux:
Deterministic Sequential Functions. Acta Informatica 29(6/7): 545-554 (1992) - [j12]Tero Harju, H. C. M. Kleijn, Michel Latteux:
Compositional representation of rational functions. RAIRO Theor. Informatics Appl. 26: 243-255 (1992) - 1991
- [j11]Karel Culík II, Tero Harju:
Splicing semigroups of dominoes and DNA. Discret. Appl. Math. 31(3): 261-277 (1991) - [j10]Tero Harju, H. C. M. Kleijn:
Decidability problems for unary output sequential transducers. Discret. Appl. Math. 32(2): 131-140 (1991) - [j9]Tero Harju, Juhani Karhumäki:
The Equivalence Problem of Multitape Finite Automata. Theor. Comput. Sci. 78(2): 347-355 (1991) - 1990
- [c3]Tero Harju, Juhani Karhumäki:
Decidability of the Multiplicity Equivalence of Multitape Finite Automata. STOC 1990: 477-481
1980 – 1989
- 1989
- [j8]Tero Harju, H. C. M. Kleijn:
Cardinality Problems of Composition of Morphisms and Inverse Morphisms. Math. Syst. Theory 22(3): 151-159 (1989) - [c2]Karel Culík II, Tero Harju:
Dominoes and the Regularity of DNS Splicing Languages. ICALP 1989: 222-233 - 1986
- [j7]Tero Harju, Juhani Karhumäki, H. C. M. Kleijn:
On morphic generation of regular languages. Discret. Appl. Math. 15(1): 55-60 (1986) - [j6]Tero Harju, Matti Linna:
On the Periodicity of Morphisms on Free Monoids. RAIRO Theor. Informatics Appl. 20(1): 47-54 (1986) - 1984
- [j5]Karel Culík II, Tero Harju:
The omega-Sequence Problem for DOL Systems Is Decidable. J. ACM 31(2): 282-298 (1984) - [j4]Tero Harju, Matti Linna:
The Equations h(w)=w-n in Binary Alphabets. Theor. Comput. Sci. 33: 327-329 (1984) - 1982
- [j3]Karel Culík II, Tero Harju:
Dominoes Over a Free Monoid. Theor. Comput. Sci. 18: 279-300 (1982) - 1981
- [c1]Karel Culík II, Tero Harju:
The omega-Sequence Equivalence Problem for DOL Systems Is Decidable. STOC 1981: 1-6
1970 – 1979
- 1979
- [j2]Tero Harju:
A Simulation Result for the Auxiliary Pushdown Automata. J. Comput. Syst. Sci. 19(2): 119-132 (1979) - 1977
- [j1]Tero Harju:
A Polynomial Recognition Algorithm for the EDTOL Languages. J. Inf. Process. Cybern. 13(4/5): 169-177 (1977)
Coauthor Index
[j123] [j120] [j119] [i13] [i12] [c46] [i9] [j115] [j114] [j111] [j110] [j109] [j108] [j104] [c45] [i6] [j102] [c41] [j93] [c40] [j92] [j91] [j86] [j85] [j83] [j82] [j77] [j75] [j74] [j73] [j70] [j68] [j66] [j63] [j62] [j61] [j56] [j52] [j48] [c24] [j39] [c23] [j37] [j36] [c17] [j34] [j32] [j31] [j29] [c14] [c13] [j24]
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 21:25 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:
