The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Tero Harju: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Vesa Halava, Tero Harju
    Infinite Solutions of Marked Post Correspondence Problem. [Citation Graph (0, 0)][DBLP]
    Formal and Natural Computing, 2002, pp:57-68 [Conf]
  2. Vesa Halava, Tero Harju
    Languages Accepted by Integer Weighted Finite Automata. [Citation Graph (0, 0)][DBLP]
    Jewels are Forever, 1999, pp:123-134 [Conf]
  3. Tero Harju, Hendrik Jan Hoogeboom, H. C. M. Kleijn
    Identities and Transductions. [Citation Graph (0, 0)][DBLP]
    Results and Trends in Theoretical Computer Science, 1994, pp:140-144 [Conf]
  4. Tero Harju, Juhani Karhumäki, Mario Petrich
    Compactness of Systems of Equations on Completely Regular Semigroups. [Citation Graph (0, 0)][DBLP]
    Structures in Logic and Computer Science, 1997, pp:268-280 [Conf]
  5. Tero Harju, Ion Petre, Grzegorz Rozenberg
    Formal Properties of Gene Assembly: Equivalence Problem for Overlap Graphs. [Citation Graph (0, 0)][DBLP]
    Aspects of Molecular Computing, 2004, pp:202-212 [Conf]
  6. Tero Harju, Ion Petre, Grzegorz Rozenberg
    Two Models for Gene Assembly in Ciliates. [Citation Graph (0, 0)][DBLP]
    Theory Is Forever, 2004, pp:89-101 [Conf]
  7. Tero Harju, Grzegorz Rozenberg
    Decompostion of Infinite Labeled 2-Structures. [Citation Graph (0, 0)][DBLP]
    Results and Trends in Theoretical Computer Science, 1994, pp:145-158 [Conf]
  8. Tero Harju
    Combinatorial Models of Gene Assembly. [Citation Graph (0, 0)][DBLP]
    CiE, 2005, pp:188-195 [Conf]
  9. Vesa Halava, Tero Harju
    An Undecidability Result Concerning Periodic Morphisms. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2001, pp:304-310 [Conf]
  10. Tero Harju
    Decision Questions on Integer Matrices. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2001, pp:57-68 [Conf]
  11. Tero Harju, Dirk Nowotka
    About Duval's Conjecture. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2003, pp:316-324 [Conf]
  12. Tero Harju, Grzegorz Rozenberg
    Computational Processes in Living Cells: Gene Assembly in Ciliates. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2002, pp:1-20 [Conf]
  13. Andrzej Ehrenfeucht, Tero Harju, Ion Petre, Grzegorz Rozenberg
    Patterns of Micronuclear Genes in ciliates. [Citation Graph (0, 0)][DBLP]
    DNA, 2001, pp:279-289 [Conf]
  14. Tero Harju, Chang Li, Ion Petre, Grzegorz Rozenberg
    Parallelism in Gene Assembly. [Citation Graph (0, 0)][DBLP]
    DNA, 2004, pp:138-148 [Conf]
  15. Tero Harju, Maurice Margenstern
    Splicing Systems for Universal Turing Machines. [Citation Graph (0, 0)][DBLP]
    DNA, 2004, pp:149-158 [Conf]
  16. Tero Harju, Ion Petre, Vladimir Rogojin, Grzegorz Rozenberg
    Simple Operations for Gene Assembly. [Citation Graph (0, 0)][DBLP]
    DNA, 2005, pp:96-111 [Conf]
  17. Vesa Halava, Tero Harju, Mika Hirvensalo
    Generalized PCP Is Decidable for Marked Morphisms. [Citation Graph (0, 0)][DBLP]
    FCT, 1999, pp:304-315 [Conf]
  18. Vesa Halava, Tero Harju, Hendrik Jan Hoogeboom, Michel Latteux
    Languages Defined by Generalized Equality Sets. [Citation Graph (0, 0)][DBLP]
    FCT, 2003, pp:355-363 [Conf]
  19. Tero Harju, Ion Petre, Grzegorz Rozenberg
    Tutorial on DNA Computing and Graph Transformation - Computational Nature of Gene Assembly in Ciliates. [Citation Graph (0, 0)][DBLP]
    ICGT, 2002, pp:430-434 [Conf]
  20. Tero Harju, Ion Petre, Grzegorz Rozenberg
    Tutorial on DNA Computing and Graph Transformation. [Citation Graph (0, 0)][DBLP]
    ICGT, 2004, pp:434-436 [Conf]
  21. Andrzej Ehrenfeucht, Tero Harju, Grzegorz Rozenberg
    2-Structures - A Framework For Decomposition And Transformation Of Graphs. [Citation Graph (0, 0)][DBLP]
    Handbook of Graph Grammars, 1997, pp:401-478 [Conf]
  22. Andrzej Ehrenfeucht, Jurriaan Hage, Tero Harju, Grzegorz Rozenberg
    Embedding in Switching Classes with Skew Gains. [Citation Graph (0, 0)][DBLP]
    ICGT, 2004, pp:257-270 [Conf]
  23. Jurriaan Hage, Tero Harju, Emo Welzl
    Euler Graphs, Triangle-Free Graphs and Bipartite Graphs in Switching Classes. [Citation Graph (0, 0)][DBLP]
    ICGT, 2002, pp:148-160 [Conf]
  24. Karel Culik II, Tero Harju
    Dominoes and the Regularity of DNS Splicing Languages. [Citation Graph (0, 0)][DBLP]
    ICALP, 1989, pp:222-233 [Conf]
  25. Andrzej Ehrenfeucht, Tero Harju, Grzegorz Rozenberg
    Theory of 2-Structures. [Citation Graph (0, 0)][DBLP]
    ICALP, 1995, pp:1-14 [Conf]
  26. Tero Harju, Oscar H. Ibarra, Juhani Karhumäki, Arto Salomaa
    Decision Questions Concerning Semilinearity, Morphisms, and Commutation of Languages. [Citation Graph (0, 0)][DBLP]
    ICALP, 2001, pp:579-590 [Conf]
  27. Tero Harju, Juhani Karhumäki, Wojciech Plandowski
    Compactness of Systems of Equations in Semigroups. [Citation Graph (0, 0)][DBLP]
    ICALP, 1995, pp:444-454 [Conf]
  28. Tero Harju, Alexandru Mateescu, Arto Salomaa
    Shuffle on Trajectories: The Schützenberger Product and Related Operations. [Citation Graph (0, 0)][DBLP]
    MFCS, 1998, pp:503-511 [Conf]
  29. Tero Harju, Juhani Karhumäki, Daniel Krob
    Remarks on Generalized Post Correspondence Problem. [Citation Graph (0, 0)][DBLP]
    STACS, 1996, pp:39-48 [Conf]
  30. Tero Harju, Dirk Nowotka
    Periodicity and Unbordered Words: A Proof of Duval?s Conjecture. [Citation Graph (0, 0)][DBLP]
    STACS, 2004, pp:294-304 [Conf]
  31. Karel Culik II, Tero Harju
    The omega-Sequence Equivalence Problem for DOL Systems Is Decidable [Citation Graph (0, 0)][DBLP]
    STOC, 1981, pp:1-6 [Conf]
  32. Tero Harju, Juhani Karhumäki
    Decidability of the Multiplicity Equivalence of Multitape Finite Automata [Citation Graph (0, 0)][DBLP]
    STOC, 1990, pp:477-481 [Conf]
  33. Andrzej Ehrenfeucht, Jurriaan Hage, Tero Harju, Grzegorz Rozenberg
    Complexity Issues in Switching of Graphs. [Citation Graph (0, 0)][DBLP]
    TAGT, 1998, pp:59-70 [Conf]
  34. Andrzej Ehrenfeucht, Tero Harju, Grzegorz Rozenberg
    Group Based Graph Transformations and Hierarchical Representations of Graphs. [Citation Graph (0, 0)][DBLP]
    TAGT, 1994, pp:502-520 [Conf]
  35. Tero Harju
    Characterizations of Regularity. [Citation Graph (0, 0)][DBLP]
    FSMNLP, 2005, pp:1-8 [Conf]
  36. Andrzej Ehrenfeucht, Tero Harju, Grzegorz Rozenberg
    Embedding linear orders in grids. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 2006, v:42, n:6-7, pp:419-428 [Journal]
  37. Tero Harju, H. C. M. Kleijn, Michel Latteux
    Deterministic Sequential Functions. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1992, v:29, n:6/7, pp:545-554 [Journal]
  38. Tero Harju, Dirk Nowotka
    Periods in Extensions of Words. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 2006, v:43, n:3, pp:165-171 [Journal]
  39. Tero Harju, Dirk Nowotka
    Periodicity and Unbordered Words: A Proof of the Extended Duval Conjecture [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  40. Vesa Halava, Tero Harju, Mika Hirvensalo
    Positivity of second order linear recurrent sequences. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:3, pp:447-451 [Journal]
  41. Vesa Halava, Tero Harju, Juhani Karhumäki
    Decidability of the binary infinite Post Correspondence Problem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:130, n:3, pp:521-526 [Journal]
  42. Andrzej Ehrenfeucht, Tero Harju, Grzegorz Rozenberg
    Finite metrics in switching classes. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:1, pp:68-73 [Journal]
  43. Andrzej Ehrenfeucht, Tero Harju, Grzegorz Rozenberg
    Transitivity of local complementation and switching on graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:278, n:1-3, pp:45-60 [Journal]
  44. Jurriaan Hage, Tero Harju
    The size of switching classes with skew gains. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:215, n:, pp:81-92 [Journal]
  45. Vesa Halava, Tero Harju
    Some New Results on Post Correspondence Problem and Its Modifications. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 2001, v:73, n:, pp:131-141 [Journal]
  46. Vesa Halava, Tero Harju, Michel Latteux
    Representation of Regular Languages by Equality Sets. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 2005, v:86, n:, pp:224-228 [Journal]
  47. Tero Harju, H. C. M. Kleijn
    Morphisms and rational tranducers. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1993, v:51, n:, pp:168-180 [Journal]
  48. Tero Harju, Dirk Nowotka
    Periodicity and Unbordered Segments of Words. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 2003, v:80, n:, pp:162-167 [Journal]
  49. Tero Harju, Ion Petre, Grzegorz Rozenberg
    Gene Assembly in Ciliates Part I. Molecular Operations. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 2003, v:81, n:, pp:236-249 [Journal]
  50. Tero Harju, Ion Petre, Grzegorz Rozenberg
    Gene Assembly in Celiates. Part I. Molecular Operations (Column: Natural Computing). [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 2004, v:82, n:, pp:227-241 [Journal]
  51. Tero Harju
    A Polynomial Recognition Algorithm for the EDTOL Languages. [Citation Graph (0, 0)][DBLP]
    Elektronische Informationsverarbeitung und Kybernetik, 1977, v:13, n:4/5, pp:169-177 [Journal]
  52. Jurriaan Hage, Tero Harju
    Acyclicity of Switching Classes. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1998, v:19, n:3, pp:321-327 [Journal]
  53. Jurriaan Hage, Tero Harju, Emo Welzl
    Euler Graphs, Triangle-Free Graphs and Bipartite Graphs in Switching Classes. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2003, v:58, n:1, pp:23-37 [Journal]
  54. Vesa Halava, Tero Harju
    Undecidability in Integer Weighted Finite Automata. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1999, v:38, n:1-2, pp:189-200 [Journal]
  55. Tero Harju, Grzegorz Rozenberg
    Reductions for Primitive 2-Structures. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1994, v:20, n:1/2/3, pp:133-144 [Journal]
  56. Vesa Halava, Tero Harju, Juhani Karhumäki
    Undecidability in omega-Regular Languages. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2006, v:73, n:1-2, pp:119-125 [Journal]
  57. Andrzej Ehrenfeucht, Jurriaan Hage, Tero Harju, Grzegorz Rozenberg
    The Embedding Problem for Switching Classes of Graphs. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2006, v:74, n:1, pp:115-134 [Journal]
  58. Vesa Halava, Tero Harju, Mika Hirvensalo
    Generalized Post Correspondence Problem for Marked Morphisms. [Citation Graph (0, 0)][DBLP]
    IJAC, 2000, v:10, n:6, pp:757-772 [Journal]
  59. Tero Harju, Dirk Nowotka
    Minimal Duval Extensions. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2004, v:15, n:2, pp:349-354 [Journal]
  60. Andrzej Ehrenfeucht, Jurriaan Hage, Tero Harju, Grzegorz Rozenberg
    Pancyclicity in switching classes. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:73, n:5-6, pp:153-156 [Journal]
  61. Vesa Halava, Tero Harju, Lucian Ilie
    On a Geometric Problem of Zigzags. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1997, v:62, n:1, pp:1-4 [Journal]
  62. Vesa Halava, Tero Harju, Michel Latteux
    Equality sets of prefix morphisms and regular star languages. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2005, v:94, n:4, pp:151-154 [Journal]
  63. Vesa Halava, Tero Harju
    Undecidability of the equivalence of finite substitutions on regular language. [Citation Graph (0, 0)][DBLP]
    ITA, 1999, v:33, n:2, pp:117-124 [Journal]
  64. Tero Harju, Lucian Ilie
    Languages Obtained from Infinite Words. [Citation Graph (0, 0)][DBLP]
    ITA, 1997, v:31, n:5, pp:445-455 [Journal]
  65. Tero Harju, N. W. Keesmaat, H. C. M. Kleijn
    The Intersection Problem for Alphabetic Vector Monoids. [Citation Graph (0, 0)][DBLP]
    ITA, 1994, v:28, n:3-4, pp:295-301 [Journal]
  66. Tero Harju, H. C. M. Kleijn, Michel Latteux
    Compositional representation of rational functions. [Citation Graph (0, 0)][DBLP]
    ITA, 1992, v:26, n:, pp:243-256 [Journal]
  67. Tero Harju, Matti Linna
    On the Periodicity of Morphisms on Free Monoids. [Citation Graph (0, 0)][DBLP]
    ITA, 1986, v:20, n:1, pp:47-54 [Journal]
  68. Tero Harju, Dirk Nowotka
    Density of Critical Factorizations. [Citation Graph (0, 0)][DBLP]
    ITA, 2002, v:36, n:3, pp:315-327 [Journal]
  69. Karel Culik II, Tero Harju
    The omega-Sequence Problem for DOL Systems Is Decidable. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1984, v:31, n:2, pp:282-298 [Journal]
  70. Tero Harju
    A Simulation Result for the Auxiliary Pushdown Automata. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1979, v:19, n:2, pp:119-132 [Journal]
  71. Tero Harju, Oscar H. Ibarra, Juhani Karhumäki, Arto Salomaa
    Some Decision Problems Concerning Semilinearity and Commutation. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2002, v:65, n:2, pp:278-294 [Journal]
  72. Vesa Halava, Tero Harju, Lucian Ilie
    Periods and Binary Words. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2000, v:89, n:2, pp:298-303 [Journal]
  73. Tero Harju, Dirk Nowotka
    Border correlation of binary words. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2004, v:108, n:2, pp:331-341 [Journal]
  74. Andrzej Ehrenfeucht, Tero Harju, Grzegorz Rozenberg
    Invariants of Inversive 2-Structures on Groups of Labels. [Citation Graph (0, 0)][DBLP]
    Mathematical Structures in Computer Science, 1997, v:7, n:4, pp:303-327 [Journal]
  75. Andrzej Ehrenfeucht, Tero Harju, Ion Petre, Grzegorz Rozenberg
    Characterizing the Micronuclear Gene Patterns in Ciliates. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2002, v:35, n:5, pp:501-519 [Journal]
  76. Tero Harju, H. C. M. Kleijn
    Cardinality Problems of Composition of Morphisms and Inverse Morphisms. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1989, v:22, n:3, pp:151-159 [Journal]
  77. Tero Harju, Chang Li, Ion Petre, Grzegorz Rozenberg
    Parallelism in Gene Assembly. [Citation Graph (0, 0)][DBLP]
    Natural Computing, 2006, v:5, n:2, pp:203-223 [Journal]
  78. Jurriaan Hage, Tero Harju
    A Characterization of Acyclic Switching Classes of Graphs Using Forbidden Subgraphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2004, v:18, n:1, pp:159-176 [Journal]
  79. Christian Choffrut, Tero Harju, Juhani Karhumäki
    A Note on Decidability Questions on Presentations of Word Semigroups. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:183, n:1, pp:83-92 [Journal]
  80. Karel Culik II, Tero Harju
    Dominoes Over a Free Monoid. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1982, v:18, n:, pp:279-300 [Journal]
  81. Andrzej Ehrenfeucht, Tero Harju, Ion Petre, David M. Prescott, Grzegorz Rozenberg
    Formal systems for gene assembly in ciliates. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:292, n:1, pp:199-219 [Journal]
  82. Andrzej Ehrenfeucht, Tero Harju, Grzegorz Rozenberg
    Gene assembly through cyclic graph decomposition. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:281, n:1-2, pp:325-349 [Journal]
  83. Joost Engelfriet, Tero Harju, Andrzej Proskurowski, Grzegorz Rozenberg
    Characterization and Complexity of Uniformly Non Primitive Labeled 2-Structures. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:154, n:2, pp:247-282 [Journal]
  84. Vesa Halava, Tero Harju, Mika Hirvensalo
    Binary (generalized) Post Correspondence Problem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:276, n:1-2, pp:183-204 [Journal]
  85. Tero Harju, Lucian Ilie
    On Quasi Orders of Words and the Confluence Property. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:200, n:1-2, pp:205-224 [Journal]
  86. Tero Harju, Juhani Karhumäki
    Many aspects of defect theorems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:324, n:1, pp:35-54 [Journal]
  87. Tero Harju, Juhani Karhumäki
    The Equivalence Problem of Multitape Finite Automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:78, n:2, pp:347-355 [Journal]
  88. Tero Harju, H. C. M. Kleijn, Michel Latteux, Alain Terlutte
    Representation of Rational Functions with Prefix and Suffix Codings. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:134, n:2, pp:403-413 [Journal]
  89. Tero Harju, Juhani Karhumäki, Antonio Restivo
    Preface. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:339, n:1, pp:1-2 [Journal]
  90. Tero Harju, Matti Linna
    The Equations h(w)=w-n in Binary Alphabets. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1984, v:33, n:, pp:327-329 [Journal]
  91. Tero Harju, Marjo Lipponen, Alexandru Mateescu
    Flatwords and Post Correspondence Problem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:161, n:1&2, pp:93-108 [Journal]
  92. Tero Harju, Arto Lepistö, Dirk Nowotka
    A characterization of periodicity of bi-infinite words. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:347, n:1-2, pp:419-422 [Journal]
  93. Tero Harju, Dirk Nowotka
    On the independence of equations in three variables. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:307, n:1, pp:139-172 [Journal]
  94. Tero Harju, Dirk Nowotka
    On the equation in a free semigroup. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:330, n:1, pp:117-121 [Journal]
  95. Tero Harju, Dirk Nowotka
    Counting bordered and primitive words with a fixed weight. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:340, n:1, pp:273-279 [Journal]
  96. Tero Harju, Dirk Nowotka
    On unique factorizations of primitive words. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:356, n:1-2, pp:186-189 [Journal]
  97. Tero Harju, Chang Li, Ion Petre, Grzegorz Rozenberg
    Complexity Measures for Gene Assembly. [Citation Graph (0, 0)][DBLP]
    KDECB, 2006, pp:42-60 [Conf]
  98. Andrzej Ehrenfeucht, Tero Harju, Paulien ten Pas, Grzegorz Rozenberg
    Permutations, parenthesis words, and Schröder numbers. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:190, n:1-3, pp:259-264 [Journal]
  99. Andrzej Ehrenfeucht, Tero Harju, Grzegorz Rozenberg
    Incremental construction of 2-structures. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:128, n:1-3, pp:113-141 [Journal]
  100. Tero Harju, Dirk Nowotka
    Periodicity and unbordered words: A proof of the extended duval conjecture. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2007, v:54, n:4, pp:- [Journal]
  101. Vesa Halava, Tero Harju, Juhani Karhumäki
    The Structure of Infinite Solutions of Marked and Binary Post Correspondence Problems. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2007, v:40, n:1, pp:43-54 [Journal]
  102. Vesa Halava, Tero Harju, Juhani Karhumäki, Michel Latteux
    Extension of the decidability of the marked PCP to instances with unique blocks. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:380, n:3, pp:355-362 [Journal]

  103. Post Correspondence Problem and Small Dimensional Matrices. [Citation Graph (, )][DBLP]


  104. On the Periodicity of Morphic Words. [Citation Graph (, )][DBLP]


  105. Modelling Simple Operations for Gene Assembly. [Citation Graph (, )][DBLP]


  106. Patterns of simple gene assembly in ciliates. [Citation Graph (, )][DBLP]


  107. Graph theoretic approach to parallel gene assembly. [Citation Graph (, )][DBLP]


  108. Splicing semigroups of dominoes and DNA. [Citation Graph (, )][DBLP]


  109. Decidability problems for unary output sequential transducers. [Citation Graph (, )][DBLP]


  110. Unbordered factors and Lyndon words. [Citation Graph (, )][DBLP]


  111. Interaction Properties of Relational Periods. [Citation Graph (, )][DBLP]


Search in 0.008secs, Finished in 0.013secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002